Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/ipl/ipl113.bht:"
download as .bib file
@article{DBLP:journals/ipl/AcerbiDF13,
author = {Luigi Acerbi and
Alberto Dennunzio and
Enrico Formenti},
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},
url = {https://doi.org/10.1016/j.ipl.2012.12.009},
doi = {10.1016/J.IPL.2012.12.009},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AcerbiDF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AhadiD13,
author = {Arash Ahadi and
Ali Dehghan},
title = {The complexity of the proper orientation number},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {799--803},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.017},
doi = {10.1016/J.IPL.2013.07.017},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AhadiD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AhmadianSA13,
author = {Zahra Ahmadian and
Mahmoud Salmasizadeh and
Mohammad Reza Aref},
title = {Desynchronization attack on {RAPP} ultralightweight authentication
protocol},
journal = {Inf. Process. Lett.},
volume = {113},
number = {7},
pages = {205--209},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.003},
doi = {10.1016/J.IPL.2013.01.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AhmadianSA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Al-BawaniS13,
author = {Kamal Al{-}Bawani and
Alexander Souza},
title = {Buffer overflow management with class segregation},
journal = {Inf. Process. Lett.},
volume = {113},
number = {4},
pages = {145--150},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.014},
doi = {10.1016/J.IPL.2012.12.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Al-BawaniS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlTawyKY13,
author = {Riham AlTawy and
Aleksandar Kircanski and
Amr M. Youssef},
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},
url = {https://doi.org/10.1016/j.ipl.2013.07.015},
doi = {10.1016/J.IPL.2013.07.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlTawyKY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlamR13,
author = {Muhammad Rashed Alam and
M. Sohel Rahman},
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},
url = {https://doi.org/10.1016/j.ipl.2013.03.013},
doi = {10.1016/J.IPL.2013.03.013},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlamR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Alevizos13,
author = {Panagiotis D. Alevizos},
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},
url = {https://doi.org/10.1016/j.ipl.2012.11.002},
doi = {10.1016/J.IPL.2012.11.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Alevizos13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlonsoR13,
author = {Laurent Alonso and
Edward M. Reingold},
title = {Analysis of Boyer and Moore's {MJRTY} algorithm},
journal = {Inf. Process. Lett.},
volume = {113},
number = {13},
pages = {495--497},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.005},
doi = {10.1016/J.IPL.2013.04.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlonsoR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AmirPR13,
author = {Amihood Amir and
Haim Paryenty and
Liam Roditty},
title = {On the hardness of the Consensus String problem},
journal = {Inf. Process. Lett.},
volume = {113},
number = {10-11},
pages = {371--374},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.016},
doi = {10.1016/J.IPL.2013.02.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AmirPR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtallahGW13,
author = {Mikhail J. Atallah and
Elena Grigorescu and
Yi Wu},
title = {A lower-variance randomized algorithm for approximate string matching},
journal = {Inf. Process. Lett.},
volume = {113},
number = {18},
pages = {690--692},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.005},
doi = {10.1016/J.IPL.2013.06.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtallahGW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtenieseSFM13,
author = {Giuseppe Ateniese and
Alfredo De Santis and
Anna Lisa Ferrara and
Barbara Masucci},
title = {A note on time-bound hierarchical key assignment schemes},
journal = {Inf. Process. Lett.},
volume = {113},
number = {5-6},
pages = {151--155},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.006},
doi = {10.1016/J.IPL.2013.01.006},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtenieseSFM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AvitabileMP13,
author = {Tess Avitabile and
Claire Mathieu and
Laura H. Parkinson},
title = {Online constrained optimization with recourse},
journal = {Inf. Process. Lett.},
volume = {113},
number = {3},
pages = {81--86},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.09.011},
doi = {10.1016/J.IPL.2012.09.011},
timestamp = {Thu, 16 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AvitabileMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AvniK13,
author = {Guy Avni and
Orna Kupferman},
title = {When does abstraction help?},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {901--905},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.09.007},
doi = {10.1016/J.IPL.2013.09.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AvniK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BadkobehFKL13,
author = {Golnaz Badkobeh and
Gabriele Fici and
Steve Kroon and
Zsuzsanna Lipt{\'{a}}k},
title = {Binary jumbled string matching for highly run-length compressible
texts},
journal = {Inf. Process. Lett.},
volume = {113},
number = {17},
pages = {604--608},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.007},
doi = {10.1016/J.IPL.2013.05.007},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BadkobehFKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Baek13,
author = {Yoo{-}Jin Baek},
title = {Scalar recoding and regular 2\({}^{\mbox{\emph{w}}}\)-ary right-to-left
{EC} scalar multiplication algorithm},
journal = {Inf. Process. Lett.},
volume = {113},
number = {10-11},
pages = {357--360},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.002},
doi = {10.1016/J.IPL.2013.02.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Baek13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarenghiCMP13,
author = {Alessandro Barenghi and
Stefano Crespi{-}Reghizzi and
Dino Mandrioli and
Matteo Pradella},
title = {Parallel parsing of operator precedence grammars},
journal = {Inf. Process. Lett.},
volume = {113},
number = {7},
pages = {245--249},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.008},
doi = {10.1016/J.IPL.2013.01.008},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BarenghiCMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Baril13,
author = {Jean{-}Luc Baril},
title = {Statistics-preserving bijections between classical and cyclic permutations},
journal = {Inf. Process. Lett.},
volume = {113},
number = {1-2},
pages = {17--22},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.10.003},
doi = {10.1016/J.IPL.2012.10.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Baril13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarmpaliasHLM13,
author = {George Barmpalias and
Rupert H{\"{o}}lzl and
Andrew E. M. Lewis and
Wolfgang Merkle},
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},
url = {https://doi.org/10.1016/j.ipl.2013.01.007},
doi = {10.1016/J.IPL.2013.01.007},
timestamp = {Mon, 08 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BarmpaliasHLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeyersdorffGL13,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria},
title = {A characterization of tree-like Resolution size},
journal = {Inf. Process. Lett.},
volume = {113},
number = {18},
pages = {666--671},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.002},
doi = {10.1016/J.IPL.2013.06.002},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BeyersdorffGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BjorklundK13,
author = {Andreas Bj{\"{o}}rklund and
Petteri Kaski},
title = {Counting closed trails},
journal = {Inf. Process. Lett.},
volume = {113},
number = {1-2},
pages = {1--3},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.09.006},
doi = {10.1016/J.IPL.2012.09.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BjorklundK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BolligC13,
author = {Beate Bollig and
Michael Capelle},
title = {Priority functions for the approximation of the metric {TSP}},
journal = {Inf. Process. Lett.},
volume = {113},
number = {14-16},
pages = {584--591},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.002},
doi = {10.1016/J.IPL.2013.05.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BolligC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bonifaci13,
author = {Vincenzo Bonifaci},
title = {Physarum can compute shortest paths: {A} short proof},
journal = {Inf. Process. Lett.},
volume = {113},
number = {1-2},
pages = {4--7},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.09.005},
doi = {10.1016/J.IPL.2012.09.005},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bonifaci13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BonomoGR13,
author = {Flavia Bonomo and
Monia Giandomenico and
Fabrizio Rossi},
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},
url = {https://doi.org/10.1016/j.ipl.2013.05.014},
doi = {10.1016/J.IPL.2013.05.014},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BonomoGR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstatterMW13,
author = {Nina Brandst{\"{a}}tter and
Wilfried Meidl and
Arne Winterhof},
title = {Addendum to Sidel'nikov sequences over nonprime fields},
journal = {Inf. Process. Lett.},
volume = {113},
number = {9},
pages = {332--336},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.008},
doi = {10.1016/J.IPL.2013.02.008},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstatterMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Calamoneri13,
author = {Tiziana Calamoneri},
title = {Optimal \emph{L}(\emph{{\(\delta\)}}\({}_{\mbox{1}}\), \emph{{\(\delta\)}}\({}_{\mbox{2}}\),
1)-labeling of eight-regular grids},
journal = {Inf. Process. Lett.},
volume = {113},
number = {10-11},
pages = {361--364},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.003},
doi = {10.1016/J.IPL.2013.03.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Calamoneri13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CarayolE13,
author = {Arnaud Carayol and
Zolt{\'{a}}n {\'{E}}sik},
title = {The FC-rank of a context-free language},
journal = {Inf. Process. Lett.},
volume = {113},
number = {8},
pages = {285--287},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.005},
doi = {10.1016/J.IPL.2013.01.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CarayolE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CariowC13,
author = {Aleksandr Cariow and
Galina Cariowa},
title = {An algorithm for fast multiplication of sedenions},
journal = {Inf. Process. Lett.},
volume = {113},
number = {9},
pages = {324--331},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.011},
doi = {10.1016/J.IPL.2013.02.011},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CariowC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CepekKK13,
author = {Ondrej Cepek and
Petr Kucera and
Stanislav Kurik},
title = {Boolean functions with long prime implicants},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {698--703},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.001},
doi = {10.1016/J.IPL.2013.07.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CepekKK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChaimA13,
author = {Marcos Lordello Chaim and
Roberto Paulo Andrioli de Araujo},
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},
url = {https://doi.org/10.1016/j.ipl.2013.02.007},
doi = {10.1016/J.IPL.2013.02.007},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChaimA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chang13,
author = {Ching{-}Lueh Chang},
title = {Deterministic sublinear-time approximations for metric 1-median selection},
journal = {Inf. Process. Lett.},
volume = {113},
number = {8},
pages = {288--292},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.003},
doi = {10.1016/J.IPL.2013.02.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chang13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangCKP13,
author = {Gerard Jennhwa Chang and
Chan{-}Wei Chang and
David Kuo and
Sheung{-}Hung Poon},
title = {Algorithmic aspect of stratified domination in graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {861--865},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.08.008},
doi = {10.1016/J.IPL.2013.08.008},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangCKP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangLR13,
author = {Maw{-}Shang Chang and
Chuang{-}Chieh Lin and
Peter Rossmanith},
title = {Testing consistency of quartet topologies: a parameterized approach},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {852--857},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.08.006},
doi = {10.1016/J.IPL.2013.08.006},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangLR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenHK13,
author = {Taolue Chen and
Tingting Han and
Marta Z. Kwiatkowska},
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},
url = {https://doi.org/10.1016/j.ipl.2013.01.004},
doi = {10.1016/J.IPL.2013.01.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenHK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenPTZ13,
author = {Qi Chen and
Dingyi Pei and
Chunming Tang and
Gansen Zhao},
title = {Efficient integer span program for hierarchical threshold access structure},
journal = {Inf. Process. Lett.},
volume = {113},
number = {17},
pages = {621--627},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.009},
doi = {10.1016/J.IPL.2013.05.009},
timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChenPTZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenW13,
author = {Danny Z. Chen and
Haitao Wang},
title = {A note on searching line arrangements and applications},
journal = {Inf. Process. Lett.},
volume = {113},
number = {14-16},
pages = {518--521},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.011},
doi = {10.1016/J.IPL.2013.04.011},
timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenXDHJ13,
author = {Xin Chen and
Zhenzhen Xu and
Gy{\"{o}}rgy D{\'{o}}sa and
Xin Han and
He Jiang},
title = {Semi-online hierarchical scheduling problems with buffer or rearrangements},
journal = {Inf. Process. Lett.},
volume = {113},
number = {4},
pages = {127--131},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.007},
doi = {10.1016/J.IPL.2012.12.007},
timestamp = {Thu, 03 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenXDHJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenYQ13,
author = {Yuhuan Chen and
Chenfu Yi and
Dengyu Qiao},
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},
url = {https://doi.org/10.1016/j.ipl.2013.09.002},
doi = {10.1016/J.IPL.2013.09.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenYQ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenZCD13,
author = {Yong Chen and
An Zhang and
Guangting Chen and
Jianming Dong},
title = {Approximation algorithms for parallel open shop scheduling},
journal = {Inf. Process. Lett.},
volume = {113},
number = {7},
pages = {220--224},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.009},
doi = {10.1016/J.IPL.2013.01.009},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenZCD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengLS13,
author = {Eddie Cheng and
L{\'{a}}szl{\'{o}} Lipt{\'{a}}k and
Daniel E. Steffy},
title = {Strong local diagnosability of (\emph{n}, \emph{k})(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},
url = {https://doi.org/10.1016/j.ipl.2013.03.002},
doi = {10.1016/J.IPL.2013.03.002},
timestamp = {Sat, 01 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChengLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengZ13,
author = {Qi Cheng and
Jincheng Zhuang},
title = {On certain computations of Pisot numbers},
journal = {Inf. Process. Lett.},
volume = {113},
number = {8},
pages = {271--275},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.018},
doi = {10.1016/J.IPL.2013.01.018},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChengZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChinTHP13,
author = {Ji{-}Jian Chin and
Syh{-}Yuan Tan and
Swee{-}Huay Heng and
Raphael C.{-}W. Phan},
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},
url = {https://doi.org/10.1016/j.ipl.2013.04.015},
doi = {10.1016/J.IPL.2013.04.015},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChinTHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Civril13,
author = {Ali {\c{C}}ivril},
title = {A note on the hardness of sparse approximation},
journal = {Inf. Process. Lett.},
volume = {113},
number = {14-16},
pages = {543--545},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.014},
doi = {10.1016/J.IPL.2013.04.014},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Civril13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CranstonO13,
author = {Daniel W. Cranston and
Suil O},
title = {Hamiltonicity in connected regular graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {858--860},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.08.005},
doi = {10.1016/J.IPL.2013.08.005},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CranstonO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CrochemoreIKKPRRTW13,
author = {Maxime Crochemore and
Costas S. Iliopoulos and
Tomasz Kociumaka and
Marcin Kubica and
Jakub Pachocki and
Jakub Radoszewski and
Wojciech Rytter and
Wojciech Tyczynski and
Tomasz Walen},
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},
url = {https://doi.org/10.1016/j.ipl.2012.11.001},
doi = {10.1016/J.IPL.2012.11.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CrochemoreIKKPRRTW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CyganP13,
author = {Marek Cygan and
Marcin Pilipczuk},
title = {Split Vertex Deletion meets Vertex Cover: New fixed-parameter and
exact exponential-time algorithms},
journal = {Inf. Process. Lett.},
volume = {113},
number = {5-6},
pages = {179--182},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.001},
doi = {10.1016/J.IPL.2013.01.001},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CyganP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Czap13,
author = {J{\'{u}}lius Czap},
title = {A note on total colorings of 1-planar graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {14-16},
pages = {516--517},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.009},
doi = {10.1016/J.IPL.2013.04.009},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Czap13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DaiL13,
author = {Benqiu Dai and
Wensong Lin},
title = {On (\emph{s}, \emph{t})(s, t)-relaxed \emph{L}(2, 1)L(2, 1)-labelings
of the square lattice},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {704--709},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.012},
doi = {10.1016/J.IPL.2013.06.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DaiL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasJS13,
author = {Sudipta Das and
Lawrence Jenkins and
Debasis Sengupta},
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},
url = {https://doi.org/10.1016/j.ipl.2012.12.015},
doi = {10.1016/J.IPL.2012.12.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DasJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DeanM13,
author = {Brian C. Dean and
Raghuveer Mohan},
title = {Building Cartesian trees from free trees with k leaves},
journal = {Inf. Process. Lett.},
volume = {113},
number = {9},
pages = {345--349},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.014},
doi = {10.1016/J.IPL.2013.02.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DeanM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Didimo13,
author = {Walter Didimo},
title = {Density of straight-line 1-planar graph drawings},
journal = {Inf. Process. Lett.},
volume = {113},
number = {7},
pages = {236--240},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.013},
doi = {10.1016/J.IPL.2013.01.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Didimo13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Doerr13,
author = {Benjamin Doerr},
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},
url = {https://doi.org/10.1016/j.ipl.2013.07.011},
doi = {10.1016/J.IPL.2013.07.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Doerr13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DongZQF13,
author = {Deshuai Dong and
Xue Zhang and
Longjiang Qu and
Shaojing Fu},
title = {A note on vectorial bent functions},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {866--870},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.024},
doi = {10.1016/J.IPL.2013.07.024},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DongZQF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DudekF0S13,
author = {Andrzej Dudek and
Alan M. Frieze and
Andrzej Rucinski and
Matas Sileikis},
title = {Approximate counting of regular hypergraphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {785--788},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.018},
doi = {10.1016/J.IPL.2013.07.018},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DudekF0S13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Duraj13,
author = {Lech Duraj},
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},
url = {https://doi.org/10.1016/j.ipl.2012.11.007},
doi = {10.1016/J.IPL.2012.11.007},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Duraj13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuttaHR13,
author = {Amit Kumar Dutta and
Masud Hasan and
M. Sohel Rahman},
title = {Prefix transpositions on binary and ternary strings},
journal = {Inf. Process. Lett.},
volume = {113},
number = {8},
pages = {265--270},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.017},
doi = {10.1016/J.IPL.2013.01.017},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DuttaHR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuttingHW13,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
title = {Sponsored search, market equilibria, and the Hungarian Method},
journal = {Inf. Process. Lett.},
volume = {113},
number = {3},
pages = {67--73},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.11.006},
doi = {10.1016/J.IPL.2012.11.006},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DuttingHW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ElkindO13,
author = {Edith Elkind and
James B. Orlin},
title = {On the hardness of finding subsets with equal average},
journal = {Inf. Process. Lett.},
volume = {113},
number = {13},
pages = {477--480},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.001},
doi = {10.1016/J.IPL.2013.04.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ElkindO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EsparzaGK13,
author = {Javier Esparza and
Andreas Gaiser and
Stefan Kiefer},
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},
url = {https://doi.org/10.1016/j.ipl.2013.02.015},
doi = {10.1016/J.IPL.2013.02.015},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EsparzaGK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FarzanyarKC13,
author = {Zahra Farzanyar and
Mohammad Reza Kangavari and
Nick Cercone},
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},
url = {https://doi.org/10.1016/j.ipl.2013.07.016},
doi = {10.1016/J.IPL.2013.07.016},
timestamp = {Fri, 29 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FarzanyarKC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FederS13,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {Edge-coloring almost bipartite multigraphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {18},
pages = {685--689},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.006},
doi = {10.1016/J.IPL.2013.06.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FederS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FengL13,
author = {Yun Feng and
Wensong Lin},
title = {A concise proof for total coloring subcubic graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {18},
pages = {664--665},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.003},
doi = {10.1016/J.IPL.2013.06.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FengL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FengWS13,
author = {Jun Feng and
Xueming Wang and
Hong Sun},
title = {Efficiently computable endomorphism for genus 3 hyperelliptic curve
cryptosystems},
journal = {Inf. Process. Lett.},
volume = {113},
number = {12},
pages = {405--408},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.014},
doi = {10.1016/J.IPL.2013.03.014},
timestamp = {Thu, 23 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FengWS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FengZ13,
author = {Yuan Feng and
Lijun Zhang},
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},
url = {https://doi.org/10.1016/j.ipl.2013.04.006},
doi = {10.1016/J.IPL.2013.04.006},
timestamp = {Thu, 16 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FengZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Filmus13,
author = {Yuval Filmus},
title = {Inequalities on submodular functions via term rewriting},
journal = {Inf. Process. Lett.},
volume = {113},
number = {13},
pages = {457--464},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.018},
doi = {10.1016/J.IPL.2013.03.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Filmus13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FournierV13,
author = {Herv{\'{e}} Fournier and
Antoine Vigneron},
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},
url = {https://doi.org/10.1016/j.ipl.2012.11.003},
doi = {10.1016/J.IPL.2012.11.003},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FournierV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FujitaL13,
author = {Shinya Fujita and
Linda M. Lesniak},
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},
url = {https://doi.org/10.1016/j.ipl.2013.05.015},
doi = {10.1016/J.IPL.2013.05.015},
timestamp = {Sun, 18 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FujitaL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FujitoS13,
author = {Toshihiro Fujito and
Takayoshi Sakamaki},
title = {How to guard a graph against tree moves},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {844--847},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.025},
doi = {10.1016/J.IPL.2013.07.025},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FujitoS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Galindo13,
author = {David Galindo},
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},
url = {https://doi.org/10.1016/j.ipl.2013.09.008},
doi = {10.1016/J.IPL.2013.09.008},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Galindo13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GaoXZZ13,
author = {Yang Gao and
Ming Xu and
Naijun Zhan and
Lijun Zhang},
title = {Model checking conditional {CSL} for continuous-time Markov chains},
journal = {Inf. Process. Lett.},
volume = {113},
number = {1-2},
pages = {44--50},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.09.009},
doi = {10.1016/J.IPL.2012.09.009},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GaoXZZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GerstlM13,
author = {Enrique Gerstl and
Gur Mosheiov},
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},
url = {https://doi.org/10.1016/j.ipl.2013.06.013},
doi = {10.1016/J.IPL.2013.06.013},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GerstlM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GhoshD13,
author = {Debashis Ghosh and
Lakshmi Kanta Dey},
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},
url = {https://doi.org/10.1016/j.ipl.2013.03.010},
doi = {10.1016/J.IPL.2013.03.010},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GhoshD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GiaquintaG13,
author = {Emanuele Giaquinta and
Szymon Grabowski},
title = {New algorithms for binary jumbled pattern matching},
journal = {Inf. Process. Lett.},
volume = {113},
number = {14-16},
pages = {538--542},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.013},
doi = {10.1016/J.IPL.2013.04.013},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GiaquintaG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GiaquintaGF13,
author = {Emanuele Giaquinta and
Szymon Grabowski and
Kimmo Fredriksson},
title = {Approximate pattern matching with k-mismatches in packed text},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {693--697},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.002},
doi = {10.1016/J.IPL.2013.07.002},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GiaquintaGF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GolovachHHP13,
author = {Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Choosability on H-free graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {4},
pages = {107--110},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.003},
doi = {10.1016/J.IPL.2012.12.003},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GolovachHHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GopalanR13,
author = {Abishek Gopalan and
Srinivasan Ramasubramanian},
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},
url = {https://doi.org/10.1016/j.ipl.2013.04.008},
doi = {10.1016/J.IPL.2013.04.008},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GopalanR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GovorcinKS13,
author = {Jelena Govorcin and
Martin Knor and
Riste Skrekovski},
title = {Line graph operation and small worlds},
journal = {Inf. Process. Lett.},
volume = {113},
number = {5-6},
pages = {196--200},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.013},
doi = {10.1016/J.IPL.2012.12.013},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GovorcinKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrytczukSZ13,
author = {Jaroslaw Grytczuk and
Piotr Szafruga and
Michal Zmarz},
title = {Online version of the theorem of Thue},
journal = {Inf. Process. Lett.},
volume = {113},
number = {5-6},
pages = {193--195},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.001},
doi = {10.1016/J.IPL.2012.12.001},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrytczukSZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuanL13,
author = {Li Guan and
Jianping Li},
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},
url = {https://doi.org/10.1016/j.ipl.2013.01.014},
doi = {10.1016/J.IPL.2013.01.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuanL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuillemotM13,
author = {Sylvain Guillemot and
D{\'{a}}niel Marx},
title = {A faster {FPT} algorithm for Bipartite Contraction},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {906--912},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.09.004},
doi = {10.1016/J.IPL.2013.09.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuillemotM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoLXG13,
author = {Qiaoping Guo and
Shengjia Li and
Gaokui Xu and
Yubao Guo},
title = {Notes on vertex pancyclicity of graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {710--713},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.014},
doi = {10.1016/J.IPL.2013.06.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuoLXG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GutinMY13,
author = {Gregory Z. Gutin and
Gabriele Muciaccia and
Anders Yeo},
title = {(Non-)existence of polynomial kernels for the Test Cover problem},
journal = {Inf. Process. Lett.},
volume = {113},
number = {4},
pages = {123--126},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.008},
doi = {10.1016/J.IPL.2012.12.008},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GutinMY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hasan13,
author = {Masud Hasan},
title = {On fixed size projection of simplicial polyhedra},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {882--887},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.09.001},
doi = {10.1016/J.IPL.2013.09.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hasan13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HerranzRS13,
author = {Javier Herranz and
Alexandre Ruiz and
Germ{\'{a}}n S{\'{a}}ez},
title = {Sharing many secrets with computational provable security},
journal = {Inf. Process. Lett.},
volume = {113},
number = {14-16},
pages = {572--579},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.003},
doi = {10.1016/J.IPL.2013.05.003},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HerranzRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HitchcockM13,
author = {John M. Hitchcock and
Elvira Mayordomo},
title = {Base invariance of feasible dimension},
journal = {Inf. Process. Lett.},
volume = {113},
number = {14-16},
pages = {546--551},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.004},
doi = {10.1016/J.IPL.2013.04.004},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HitchcockM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HocquardOV13,
author = {Herv{\'{e}} Hocquard and
Pascal Ochem and
Petru Valicov},
title = {Strong edge-colouring and induced matchings},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {836--843},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.026},
doi = {10.1016/J.IPL.2013.07.026},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HocquardOV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IerselL13,
author = {Leo van Iersel and
Simone Linz},
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},
url = {https://doi.org/10.1016/j.ipl.2013.02.010},
doi = {10.1016/J.IPL.2013.02.010},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IerselL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ilic13,
author = {Aleksandar Ilic},
title = {Efficient algorithm for the vertex connectivity of trapezoid graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {10-11},
pages = {398--404},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.012},
doi = {10.1016/J.IPL.2013.02.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ilic13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KantorN13,
author = {Alexander Kantor and
Kobbi Nissim},
title = {Attacks on statistical databases: The highly noisy case},
journal = {Inf. Process. Lett.},
volume = {113},
number = {12},
pages = {409--413},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.005},
doi = {10.1016/J.IPL.2013.03.005},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KantorN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KapoorN13,
author = {Kalpesh Kapoor and
Himadri Nayak},
title = {On multiset of factors of a word},
journal = {Inf. Process. Lett.},
volume = {113},
number = {3},
pages = {78--80},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.09.010},
doi = {10.1016/J.IPL.2012.09.010},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KapoorN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kara13,
author = {Orhun Kara},
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},
url = {https://doi.org/10.1016/j.ipl.2013.08.001},
doi = {10.1016/J.IPL.2013.08.001},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Kara13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KaraahmetogluSBT13,
author = {Osman Karaahmetoglu and
Muharrem Tolga Sakalli and
Ercan Bulus and
Ion Tutanescu},
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},
url = {https://doi.org/10.1016/j.ipl.2013.01.002},
doi = {10.1016/J.IPL.2013.01.002},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KaraahmetogluSBT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KarakocDH13,
author = {Ferhat Karako{\c{c}} and
H{\"{u}}seyin Demirci and
A. Emre Harmanci},
title = {Biclique cryptanalysis of LBlock and {TWINE}},
journal = {Inf. Process. Lett.},
volume = {113},
number = {12},
pages = {423--429},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.011},
doi = {10.1016/J.IPL.2013.03.011},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KarakocDH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KarpinskiLS13,
author = {Marek Karpinski and
Andrzej Lingas and
Dzmitry Sledneu},
title = {Optimal cuts and partitions in tree metrics in polynomial time},
journal = {Inf. Process. Lett.},
volume = {113},
number = {12},
pages = {447--451},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.009},
doi = {10.1016/J.IPL.2013.03.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KarpinskiLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KasperskiKZ13,
author = {Adam Kasperski and
Adam Kurpisz and
Pawel Zielinski},
title = {Approximating the min-max (regret) selecting items problem},
journal = {Inf. Process. Lett.},
volume = {113},
number = {1-2},
pages = {23--29},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.10.001},
doi = {10.1016/J.IPL.2012.10.001},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KasperskiKZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KeYC13,
author = {Pinhui Ke and
Wanghong Yu and
Zuling Chang},
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},
url = {https://doi.org/10.1016/j.ipl.2013.07.022},
doi = {10.1016/J.IPL.2013.07.022},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KeYC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KeilP13,
author = {J. Mark Keil and
Dinabandhu Pradhan},
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},
url = {https://doi.org/10.1016/j.ipl.2013.05.001},
doi = {10.1016/J.IPL.2013.05.001},
timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KeilP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KhennoufaSK13,
author = {Riadh Khennoufa and
Hamida Seba and
Hamamache Kheddouci},
title = {Edge coloring total k-labeling of generalized Petersen graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {13},
pages = {489--494},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.017},
doi = {10.1016/J.IPL.2013.03.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KhennoufaSK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kiefer13,
author = {Stefan Kiefer},
title = {{BPA} bisimilarity is EXPTIME-hard},
journal = {Inf. Process. Lett.},
volume = {113},
number = {4},
pages = {101--106},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.004},
doi = {10.1016/J.IPL.2012.12.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kiefer13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Klein13,
author = {Shmuel T. Klein},
title = {On the connection between Hamming codes, Heapsort and other methods},
journal = {Inf. Process. Lett.},
volume = {113},
number = {17},
pages = {617--620},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.013},
doi = {10.1016/J.IPL.2013.05.013},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Klein13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KocabasD13,
author = {Ilker Kocabas and
Bekir Taner Din{\c{c}}er},
title = {A new statistical strategy for pooling: {ELI}},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {739--746},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.007},
doi = {10.1016/J.IPL.2013.07.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KocabasD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KolliopoulosM13,
author = {Stavros G. Kolliopoulos and
Yannis Moysoglou},
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},
url = {https://doi.org/10.1016/j.ipl.2012.09.004},
doi = {10.1016/J.IPL.2012.09.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KolliopoulosM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KrithikaN13,
author = {R. Krithika and
N. S. Narayanaswamy},
title = {Another disjoint compression algorithm for odd cycle transversal},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {849--851},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.08.007},
doi = {10.1016/J.IPL.2013.08.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KrithikaN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Krzywkowski13,
author = {Marcin Krzywkowski},
title = {Trees having many minimal dominating sets},
journal = {Inf. Process. Lett.},
volume = {113},
number = {8},
pages = {276--279},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.020},
doi = {10.1016/J.IPL.2013.01.020},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Krzywkowski13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KubicaKRRW13,
author = {Marcin Kubica and
Tomasz Kulczynski and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
title = {A linear time algorithm for consecutive permutation pattern matching},
journal = {Inf. Process. Lett.},
volume = {113},
number = {12},
pages = {430--433},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.015},
doi = {10.1016/J.IPL.2013.03.015},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KubicaKRRW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KucherovTV13,
author = {Gregory Kucherov and
Lilla T{\'{o}}thm{\'{e}}r{\'{e}}sz and
St{\'{e}}phane Vialette},
title = {On the combinatorics of suffix arrays},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {915--920},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.09.009},
doi = {10.1016/J.IPL.2013.09.009},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KucherovTV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LambergerT13,
author = {Mario Lamberger and
Elmar Teufl},
title = {Memoryless near-collisions, revisited},
journal = {Inf. Process. Lett.},
volume = {113},
number = {3},
pages = {60--66},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.11.004},
doi = {10.1016/J.IPL.2012.11.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LambergerT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiX13,
author = {Xiang{-}Jun Li and
Jun{-}Ming Xu},
title = {Generalized measures of fault tolerance in exchanged hypercubes},
journal = {Inf. Process. Lett.},
volume = {113},
number = {14-16},
pages = {533--537},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.007},
doi = {10.1016/J.IPL.2013.04.007},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiX13a,
author = {Xiang{-}Jun Li and
Jun{-}Ming Xu},
title = {Edge-fault tolerance of hypercube-like networks},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {760--763},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.010},
doi = {10.1016/J.IPL.2013.07.010},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiX13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiangX13,
author = {Hao Liang and
Jun{-}Ming Xu},
title = {Minimum feedback arc set of m-free digraphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {8},
pages = {260--264},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.019},
doi = {10.1016/J.IPL.2013.01.019},
timestamp = {Wed, 27 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiangX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinL13,
author = {Lan Lin and
Yixun Lin},
title = {Machine scheduling with contiguous processing constraints},
journal = {Inf. Process. Lett.},
volume = {113},
number = {8},
pages = {280--284},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.004},
doi = {10.1016/J.IPL.2013.02.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinT13,
author = {Min{-}Sheng Lin and
Chao{-}Chun Ting},
title = {Computing K-terminal reliability of d-trapezoid graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {734--738},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.006},
doi = {10.1016/J.IPL.2013.07.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuLWH13,
author = {Yiguang Liu and
Stan Z. Li and
Wei Wu and
Ronggang Huang},
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},
url = {https://doi.org/10.1016/j.ipl.2012.10.002},
doi = {10.1016/J.IPL.2012.10.002},
timestamp = {Mon, 03 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuLWH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuT13,
author = {Yong{-}Jin Liu and
Kai Tang},
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},
url = {https://doi.org/10.1016/j.ipl.2012.12.010},
doi = {10.1016/J.IPL.2012.12.010},
timestamp = {Tue, 11 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiuT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LokshtanovMS13,
author = {Daniel Lokshtanov and
Neeldhara Misra and
Saket Saurabh},
title = {Imbalance is fixed parameter tractable},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {714--718},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.010},
doi = {10.1016/J.IPL.2013.06.010},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LokshtanovMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LozinP13,
author = {Vadim V. Lozin and
Christopher Purcell},
title = {Boundary properties of the satisfiability problems},
journal = {Inf. Process. Lett.},
volume = {113},
number = {9},
pages = {313--317},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.022},
doi = {10.1016/J.IPL.2013.01.022},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LozinP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuC13,
author = {Linzhen Lu and
Shaozhen Chen},
title = {A compress slide attack on the full {GOST} block cipher},
journal = {Inf. Process. Lett.},
volume = {113},
number = {17},
pages = {634--639},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.012},
doi = {10.1016/J.IPL.2013.05.012},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuccioP13,
author = {Fabrizio Luccio and
Linda Pagli},
title = {Chain rotations: {A} new look at tree distance},
journal = {Inf. Process. Lett.},
volume = {113},
number = {7},
pages = {201--204},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.015},
doi = {10.1016/J.IPL.2013.01.015},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuccioP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaY13,
author = {Ran Ma and
Jinjiang Yuan},
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},
url = {https://doi.org/10.1016/j.ipl.2013.05.006},
doi = {10.1016/J.IPL.2013.05.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MaY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaitraP13,
author = {Arpita Maitra and
Goutam Paul},
title = {Eavesdropping in semiquantum key distribution protocol},
journal = {Inf. Process. Lett.},
volume = {113},
number = {12},
pages = {418--422},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.008},
doi = {10.1016/J.IPL.2013.03.008},
timestamp = {Sun, 17 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MaitraP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MansourV13,
author = {Toufik Mansour and
Vincent Vajnovszki},
title = {Efficient generation of restricted growth words},
journal = {Inf. Process. Lett.},
volume = {113},
number = {17},
pages = {613--616},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.008},
doi = {10.1016/J.IPL.2013.05.008},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MansourV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MeshramM13,
author = {Chandrashekhar Meshram and
Suchitra A. Meshram},
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},
url = {https://doi.org/10.1016/j.ipl.2013.02.009},
doi = {10.1016/J.IPL.2013.02.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MeshramM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MorawieckiS13,
author = {Pawel Morawiecki and
Marian Srebrny},
title = {A SAT-based preimage analysis of reduced Keccak hash functions},
journal = {Inf. Process. Lett.},
volume = {113},
number = {10-11},
pages = {392--397},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.004},
doi = {10.1016/J.IPL.2013.03.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MorawieckiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mosca13,
author = {Raffaele Mosca},
title = {Maximum weight independent sets in (\emph{P}\({}_{\mbox{6}}\), co-banner)-free
graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {3},
pages = {89--93},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.10.004},
doi = {10.1016/J.IPL.2012.10.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mosca13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Moszkowski13,
author = {Ben C. Moszkowski},
title = {Interconnections between classes of sequentially compositional temporal
formulas},
journal = {Inf. Process. Lett.},
volume = {113},
number = {9},
pages = {350--353},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.005},
doi = {10.1016/J.IPL.2013.02.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Moszkowski13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nanongkai13,
author = {Danupon Nanongkai},
title = {Simple {FPTAS} for the subset-sums ratio problem},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {750--753},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.009},
doi = {10.1016/J.IPL.2013.07.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Nanongkai13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ning13,
author = {Bo Ning},
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},
url = {https://doi.org/10.1016/j.ipl.2013.07.014},
doi = {10.1016/J.IPL.2013.07.014},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Ning13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OhKM13,
author = {Jinsoo Oh and
Jin Kim and
Byung Ro Moon},
title = {On the inequivalence of bilinear algorithms for 3{\texttimes}33{\texttimes}3
matrix multiplication},
journal = {Inf. Process. Lett.},
volume = {113},
number = {17},
pages = {640--645},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.011},
doi = {10.1016/J.IPL.2013.05.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OhKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pae13,
author = {Sung{-}Il Pae},
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},
url = {https://doi.org/10.1016/j.ipl.2012.12.012},
doi = {10.1016/J.IPL.2012.12.012},
timestamp = {Tue, 24 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pae13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PandaP13,
author = {B. S. Panda and
Subhabrata Paul},
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},
url = {https://doi.org/10.1016/j.ipl.2013.07.012},
doi = {10.1016/J.IPL.2013.07.012},
timestamp = {Tue, 25 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PandaP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PangLPW13,
author = {Liaojun Pang and
Huixian Li and
Qingqi Pei and
Yumin Wang},
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},
url = {https://doi.org/10.1016/j.ipl.2013.07.019},
doi = {10.1016/J.IPL.2013.07.019},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PangLPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ParkCH13,
author = {Sun{-}Mi Park and
Ku{-}Young Chang and
Dowon Hong},
title = {Parallel \emph{GF}(3\({}^{\mbox{\emph{m}}}\)) multiplier for trinomials},
journal = {Inf. Process. Lett.},
volume = {113},
number = {4},
pages = {111--115},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.002},
doi = {10.1016/J.IPL.2012.12.002},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ParkCH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ParkI13,
author = {Jung{-}Heum Park and
Insung Ihm},
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},
url = {https://doi.org/10.1016/j.ipl.2013.04.012},
doi = {10.1016/J.IPL.2013.04.012},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ParkI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PengYWPS13,
author = {Xi Peng and
Zhang Yi and
Xiao{-}Yong Wei and
Dezhong Peng and
Yongsheng Sang},
title = {Free-gram phrase identification for modeling Chinese text},
journal = {Inf. Process. Lett.},
volume = {113},
number = {4},
pages = {137--144},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.11.005},
doi = {10.1016/J.IPL.2012.11.005},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PengYWPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RangasamyAT13,
author = {Parvathi Rangasamy and
Muhammad Akram and
S. Thilagavathi},
title = {Intuitionistic fuzzy shortest hyperpath in a network},
journal = {Inf. Process. Lett.},
volume = {113},
number = {17},
pages = {599--603},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.004},
doi = {10.1016/J.IPL.2013.05.004},
timestamp = {Fri, 22 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RangasamyAT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RenDX13,
author = {Jianfeng Ren and
Donglei Du and
Dachuan Xu},
title = {The complexity of two supply chain scheduling problems},
journal = {Inf. Process. Lett.},
volume = {113},
number = {17},
pages = {609--612},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.005},
doi = {10.1016/J.IPL.2013.05.005},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RenDX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RizziT13,
author = {Romeo Rizzi and
Alexandru I. Tomescu},
title = {Ranking, unranking and random generation of extensional acyclic digraphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {5-6},
pages = {183--187},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.010},
doi = {10.1016/J.IPL.2013.01.010},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RizziT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RotterV13,
author = {Daniel Rotter and
Jens Vygen},
title = {d-dimensional arrangement revisited},
journal = {Inf. Process. Lett.},
volume = {113},
number = {13},
pages = {498--505},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.003},
doi = {10.1016/J.IPL.2013.04.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RotterV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SanyalGM13,
author = {Biswajit Sanyal and
Prosenjit Gupta and
Subhashis Majumder},
title = {Colored top-K range-aggregate queries},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {777--784},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.013},
doi = {10.1016/J.IPL.2013.07.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SanyalGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schmid13,
author = {Markus L. Schmid},
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},
url = {https://doi.org/10.1016/j.ipl.2013.06.011},
doi = {10.1016/J.IPL.2013.06.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schmid13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schmidt13,
author = {Jens M. Schmidt},
title = {A simple test on 2-vertex- and 2-edge-connectivity},
journal = {Inf. Process. Lett.},
volume = {113},
number = {7},
pages = {241--244},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.016},
doi = {10.1016/J.IPL.2013.01.016},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Schmidt13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SchmittW13,
author = {Manuel Schmitt and
Rolf Wanka},
title = {Exploiting independent subformulas: {A} faster approximation scheme
for {\#}k-SAT},
journal = {Inf. Process. Lett.},
volume = {113},
number = {9},
pages = {337--344},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.013},
doi = {10.1016/J.IPL.2013.02.013},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SchmittW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shin13,
author = {Chan{-}Su Shin},
title = {A note on minimum-sum coverage by aligned disks},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {871--875},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.08.009},
doi = {10.1016/J.IPL.2013.08.009},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shin13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shparlinski13,
author = {Igor E. Shparlinski},
title = {Correcting noisy exponentiation black-boxes modulo a prime},
journal = {Inf. Process. Lett.},
volume = {113},
number = {12},
pages = {414--417},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.016},
doi = {10.1016/J.IPL.2013.03.016},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shparlinski13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SimoesPR13,
author = {D. R. Sim{\~{o}}es and
Jaime Portugheis and
Valdemar Cardoso da Rocha Jr.},
title = {Universal homophonic coding scheme using differential encoding and
interleaving},
journal = {Inf. Process. Lett.},
volume = {113},
number = {17},
pages = {628--633},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.010},
doi = {10.1016/J.IPL.2013.05.010},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SimoesPR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SmallM13,
author = {Lucy Small and
Oliver Mason},
title = {Nash Equilibria for competitive information diffusion on trees},
journal = {Inf. Process. Lett.},
volume = {113},
number = {7},
pages = {217--219},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.011},
doi = {10.1016/J.IPL.2013.01.011},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SmallM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SokolovD13,
author = {Andrew V. Sokolov and
A. V. Drac},
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},
url = {https://doi.org/10.1016/j.ipl.2013.07.021},
doi = {10.1016/J.IPL.2013.07.021},
timestamp = {Sat, 02 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SokolovD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SousaLL13,
author = {Leandro Soares de Sousa and
Julius Cesar Barreto Leite and
Orlando Loques},
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},
url = {https://doi.org/10.1016/j.ipl.2013.04.010},
doi = {10.1016/J.IPL.2013.04.010},
timestamp = {Fri, 22 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SousaLL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SteyaertCB13,
author = {Bart Steyaert and
Dieter Claeys and
Herwig Bruneel},
title = {The burst factor and its impact on buffer performance},
journal = {Inf. Process. Lett.},
volume = {113},
number = {18},
pages = {681--684},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.009},
doi = {10.1016/J.IPL.2013.06.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SteyaertCB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SunF13,
author = {Hongyang Sun and
Rui Fan},
title = {Improved semi-online makespan scheduling with a reordering buffer},
journal = {Inf. Process. Lett.},
volume = {113},
number = {12},
pages = {434--439},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.007},
doi = {10.1016/J.IPL.2013.03.007},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SunF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SuttichayaB13,
author = {Vasin Suttichaya and
Pattarasinee Bhattarakosol},
title = {Solving the learning parity with noise's open question},
journal = {Inf. Process. Lett.},
volume = {113},
number = {14-16},
pages = {562--566},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.016},
doi = {10.1016/J.IPL.2013.04.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SuttichayaB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur13,
author = {Dekel Tsur},
title = {Top-k document retrieval in optimal space},
journal = {Inf. Process. Lett.},
volume = {113},
number = {12},
pages = {440--443},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.012},
doi = {10.1016/J.IPL.2013.03.012},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsur13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TuY13,
author = {Jianhua Tu and
Fengmei Yang},
title = {The vertex cover \emph{P}\({}_{\mbox{3}}\)P3 problem in cubic graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {13},
pages = {481--485},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.04.002},
doi = {10.1016/J.IPL.2013.04.002},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TuY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Turau13,
author = {Volker Turau},
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},
url = {https://doi.org/10.1016/j.ipl.2013.07.008},
doi = {10.1016/J.IPL.2013.07.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Turau13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tutu13,
author = {Ionut Tutu},
title = {Comorphisms of structured institutions},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {894--900},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.09.003},
doi = {10.1016/J.IPL.2013.09.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tutu13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tyszka13,
author = {Apoloniusz Tyszka},
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},
url = {https://doi.org/10.1016/j.ipl.2013.07.004},
doi = {10.1016/J.IPL.2013.07.004},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tyszka13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VadlamudiAC13,
author = {Satya Gautam Vadlamudi and
Sandip Aine and
P. P. Chakrabarti},
title = {Incremental Beam search},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {888--893},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.08.010},
doi = {10.1016/J.IPL.2013.08.010},
timestamp = {Mon, 07 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/VadlamudiAC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vaya13,
author = {Shailesh Vaya},
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},
url = {https://doi.org/10.1016/j.ipl.2013.02.001},
doi = {10.1016/J.IPL.2013.02.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vaya13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Viderman13,
author = {Michael Viderman},
title = {{LP} decoding of codes with expansion parameter above 2/3},
journal = {Inf. Process. Lett.},
volume = {113},
number = {7},
pages = {225--228},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.012},
doi = {10.1016/J.IPL.2013.01.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Viderman13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WanDT13,
author = {Long Wan and
Xiaofang Deng and
Zhiyi Tan},
title = {Inefficiency of Nash equilibria with parallel processing policy},
journal = {Inf. Process. Lett.},
volume = {113},
number = {13},
pages = {465--469},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.03.006},
doi = {10.1016/J.IPL.2013.03.006},
timestamp = {Mon, 16 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WanDT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangS13,
author = {Gaoli Wang and
Yanzhao Shen},
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},
url = {https://doi.org/10.1016/j.ipl.2013.02.006},
doi = {10.1016/J.IPL.2013.02.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangT13,
author = {Qichun Wang and
Chik How Tan},
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},
url = {https://doi.org/10.1016/j.ipl.2013.04.017},
doi = {10.1016/J.IPL.2013.04.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangWWZ13,
author = {Lei Wang and
Xiaodong Wang and
Yingjie Wu and
Daxin Zhu},
title = {A dynamic programming solution to a generalized {LCS} problem},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {723--728},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.005},
doi = {10.1016/J.IPL.2013.07.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangWWZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangX13,
author = {Yingqian Wang and
Jinghan Xu},
title = {Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2,
0, 0)-colorable},
journal = {Inf. Process. Lett.},
volume = {113},
number = {18},
pages = {659--663},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.001},
doi = {10.1016/J.IPL.2013.06.001},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Winzen13,
author = {Carola Winzen},
title = {Direction-reversing quasi-random rumor spreading with restarts},
journal = {Inf. Process. Lett.},
volume = {113},
number = {22-24},
pages = {921--926},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.09.006},
doi = {10.1016/J.IPL.2013.09.006},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Winzen13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Wu13,
author = {Yunjian Wu},
title = {An improvement on Vizing's conjecture},
journal = {Inf. Process. Lett.},
volume = {113},
number = {3},
pages = {87--88},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.10.005},
doi = {10.1016/J.IPL.2012.10.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Wu13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YA13,
author = {Y. Asnath Victy Phamila and
Ramachandran Amutha},
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},
url = {https://doi.org/10.1016/j.ipl.2013.06.008},
doi = {10.1016/J.IPL.2013.06.008},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YahiaouiBHK13,
author = {Sa{\"{\i}}d Yahiaoui and
Yacine Belhoul and
Mohammed Haddad and
Hamamache Kheddouci},
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},
url = {https://doi.org/10.1016/j.ipl.2013.03.001},
doi = {10.1016/J.IPL.2013.03.001},
timestamp = {Fri, 08 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YahiaouiBHK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YamakamiK13,
author = {Tomoyuki Yamakami and
Yuichi Kato},
title = {The dissecting power of regular languages},
journal = {Inf. Process. Lett.},
volume = {113},
number = {4},
pages = {116--122},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.006},
doi = {10.1016/J.IPL.2012.12.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YamakamiK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangEMR13,
author = {Qingxuan Yang and
John A. Ellis and
Khalegh Mamakani and
Frank Ruskey},
title = {In-place permuting and perfect shuffling using involutions},
journal = {Inf. Process. Lett.},
volume = {113},
number = {10-11},
pages = {386--391},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.017},
doi = {10.1016/J.IPL.2013.02.017},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangEMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuXW13,
author = {Haiyan Yu and
Yinfeng Xu and
Tengyu Wu},
title = {Online inventory replenishment scheduling of temporary orders},
journal = {Inf. Process. Lett.},
volume = {113},
number = {5-6},
pages = {188--192},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.011},
doi = {10.1016/J.IPL.2012.12.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuXW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuYZH13,
author = {Cui Yu and
Xiaofan Yang and
Jing Zhang and
Li He},
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},
url = {https://doi.org/10.1016/j.ipl.2013.06.007},
doi = {10.1016/J.IPL.2013.06.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuYZH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZawidzkiST13,
author = {Michal Zawidzki and
Renate A. Schmidt and
Dmitry Tishkovsky},
title = {Satisfiability problem for modal logic with global counting operators
coded in binary is NExpTime-complete},
journal = {Inf. Process. Lett.},
volume = {113},
number = {1-2},
pages = {34--38},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.09.007},
doi = {10.1016/J.IPL.2012.09.007},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZawidzkiST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zhang13,
author = {Haihui Zhang},
title = {Corrigendum to "On 3-choosability of planar graphs with neither adjacent
triangles nor 5-, 6- and 9-cycles" [Information Processing Letters
110 {(24)} {(2010)} 1084-1087]},
journal = {Inf. Process. Lett.},
volume = {113},
number = {9},
pages = {354--356},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.005},
doi = {10.1016/J.IPL.2012.12.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zhang13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangHX13,
author = {Yan{-}Hong Zhang and
Wei Hao and
Tao Xiang},
title = {Independent spanning trees in crossed cubes},
journal = {Inf. Process. Lett.},
volume = {113},
number = {18},
pages = {653--658},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.004},
doi = {10.1016/J.IPL.2013.06.004},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangHX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangLY13,
author = {Hailiang Zhang and
Rongfei Lin and
Guanglong Yu},
title = {The largest matching root of unicyclic graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {804--806},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.003},
doi = {10.1016/J.IPL.2013.07.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangLY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouSY13,
author = {Sizhong Zhou and
Zhiren Sun and
Hui Ye},
title = {A toughness condition for fractional (\emph{k}, \emph{m})-deleted
graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {8},
pages = {255--259},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.01.021},
doi = {10.1016/J.IPL.2013.01.021},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhouSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouYC13,
author = {Xiangqian Zhou and
Bing Yao and
Xiangen Chen},
title = {Every lobster is odd-elegant},
journal = {Inf. Process. Lett.},
volume = {113},
number = {1-2},
pages = {30--33},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.09.008},
doi = {10.1016/J.IPL.2012.09.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhouYC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZunicZ13,
author = {Dragisa Zunic and
Jovisa D. Zunic},
title = {Shape ellipticity based on the first Hu moment invariant},
journal = {Inf. Process. Lett.},
volume = {113},
number = {19-21},
pages = {807--810},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.07.020},
doi = {10.1016/J.IPL.2013.07.020},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZunicZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-29 09:21 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
