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/ipl115.bht:"
download as .bib file
@article{DBLP:journals/ipl/AcetoGI15,
author = {Luca Aceto and
Eugen{-}Ioan Goriac and
Anna Ing{\'{o}}lfsd{\'{o}}ttir},
title = {A ground-complete axiomatization of stateless bisimilarity over Linda},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {212--220},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.014},
doi = {10.1016/J.IPL.2014.09.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AcetoGI15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Aggarwal15,
author = {Divesh Aggarwal},
title = {Affine-evasive sets modulo a prime},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {382--385},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.015},
doi = {10.1016/J.IPL.2014.10.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Aggarwal15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AgostaBPS15,
author = {Giovanni Agosta and
Alessandro Barenghi and
Gerardo Pelosi and
Michele Scandale},
title = {Trace-based schedulability analysis to enhance passive side-channel
attack resilience of embedded software},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {292--297},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.030},
doi = {10.1016/J.IPL.2014.09.030},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AgostaBPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AignerAJ15,
author = {Wolfgang Aigner and
Franz Aurenhammer and
Bert J{\"{u}}ttler},
title = {On triangulation axes of polygons},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {45--51},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.006},
doi = {10.1016/J.IPL.2014.08.006},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AignerAJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AkshayAOW15,
author = {S. Akshay and
Timos Antonopoulos and
Jo{\"{e}}l Ouaknine and
James Worrell},
title = {Reachability problems for Markov chains},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {155--158},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.013},
doi = {10.1016/J.IPL.2014.08.013},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AkshayAOW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlipourGZP15,
author = {Sharareh Alipour and
Mohammad Ghodsi and
Alireza Zarei and
Maryam Pourreza},
title = {Visibility testing and counting},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {649--654},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.009},
doi = {10.1016/J.IPL.2015.03.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlipourGZP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlvesB15,
author = {Sandra Alves and
Sabine Broda},
title = {A short note on type-inhabitation: Formula-trees vs. game semantics},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {908--911},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.004},
doi = {10.1016/J.IPL.2015.05.004},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlvesB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlvesRSP15,
author = {P{\'{e}}ricles Rafael Oliveira Alves and
Raphael Ernani Rodrigues and
Rafael Martins de Souza and
Fernando Magno Quint{\~{a}}o Pereira},
title = {A case for a fast trip count predictor},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {146--150},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.008},
doi = {10.1016/J.IPL.2014.08.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlvesRSP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArgiroffoLT15,
author = {Gabriela R. Argiroffo and
Valeria A. Leoni and
Pablo Daniel Torres},
title = {On the complexity of \{k\}-domination and k-tuple domination in graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {556--561},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.007},
doi = {10.1016/J.IPL.2015.01.007},
timestamp = {Mon, 23 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArgiroffoLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AshokG15,
author = {Pradeesha Ashok and
Sathish Govindarajan},
title = {On strong centerpoints},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {431--434},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.004},
doi = {10.1016/J.IPL.2014.11.004},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AshokG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AvisT15,
author = {David Avis and
Hans Raj Tiwary},
title = {A generalization of extension complexity that captures {P}},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {588--593},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.005},
doi = {10.1016/J.IPL.2015.02.005},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AvisT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BadkobehC15,
author = {Golnaz Badkobeh and
Maxime Crochemore},
title = {Infinite binary words containing repetitions of odd period},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {543--547},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.004},
doi = {10.1016/J.IPL.2015.01.004},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BadkobehC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bang-JensenH15,
author = {J{\o}rgen Bang{-}Jensen and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Vertex coloring edge-weighted digraphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {791--796},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.007},
doi = {10.1016/J.IPL.2015.05.007},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bang-JensenH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarguilB15,
author = {Joao M. M. Barguil and
Paulo S. L. M. Barreto},
title = {Security issues in Sarkar's e-cash protocol},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {801--803},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.007},
doi = {10.1016/J.IPL.2015.06.007},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BarguilB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BasinKZ15,
author = {David A. Basin and
Felix Klaedtke and
Eugen Zalinescu},
title = {Greedily computing associative aggregations on sliding windows},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {186--192},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.009},
doi = {10.1016/J.IPL.2014.09.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BasinKZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BenderTW15,
author = {Marco Bender and
Clemens Thielen and
Stephan Westphal},
title = {Packing items into several bins facilitates approximating the separable
assignment problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {570--575},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.001},
doi = {10.1016/J.IPL.2015.02.001},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BenderTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BerardCS15,
author = {B{\'{e}}atrice B{\'{e}}rard and
Krishnendu Chatterjee and
Nathalie Sznajder},
title = {Probabilistic opacity for Markov decision processes},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {52--59},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.001},
doi = {10.1016/J.IPL.2014.09.001},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BerardCS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BevernCHKTW15,
author = {Ren{\'{e}} van Bevern and
Jiehua Chen and
Falk H{\"{u}}ffner and
Stefan Kratsch and
Nimrod Talmon and
Gerhard J. Woeginger},
title = {Approximability and parameterized complexity of multicover by c-intervals},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {744--749},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.004},
doi = {10.1016/J.IPL.2015.03.004},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BevernCHKTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BiedlHHKP15,
author = {Therese Biedl and
Martin Held and
Stefan Huber and
Dominik Kaaser and
Peter Palfrader},
title = {A simple algorithm for computing positively weighted straight skeletons
of monotone polygons},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {243--247},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.021},
doi = {10.1016/J.IPL.2014.09.021},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BiedlHHKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BliznetsCKM15,
author = {Ivan Bliznets and
Marek Cygan and
Pawel Komosa and
Luk{\'{a}}s Mach},
title = {Kernelization lower bound for Permutation Pattern Matching},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {527--531},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.001},
doi = {10.1016/J.IPL.2015.01.001},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BliznetsCKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Blondeau15,
author = {C{\'{e}}line Blondeau},
title = {Impossible differential attack on 13-round Camellia-192},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {660--666},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.008},
doi = {10.1016/J.IPL.2015.03.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Blondeau15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BodlaenderK15,
author = {Hans L. Bodlaender and
Marc J. van Kreveld},
title = {Google Scholar makes it hard - the complexity of organizing one's
publications},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {965--968},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.003},
doi = {10.1016/J.IPL.2015.07.003},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BodlaenderK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BonomoDNV15,
author = {Flavia Bonomo and
Guillermo Dur{\'{a}}n and
Amedeo Napoli and
Mario Valencia{-}Pabon},
title = {A one-to-one correspondence between potential solutions of the cluster
deletion problem and the minimum sum coloring problem, and its application
to \{k\}-sparse graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {600--603},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.007},
doi = {10.1016/J.IPL.2015.02.007},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BonomoDNV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BragaSL15,
author = {Andrei Braga and
Cid C. de Souza and
Orlando Lee},
title = {The Eternal Dominating Set problem for proper interval graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {582--587},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.004},
doi = {10.1016/J.IPL.2015.02.004},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BragaSL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Brand15,
author = {Michael Brand},
title = {Arbitrary sequence RAMs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {193--198},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.010},
doi = {10.1016/J.IPL.2014.09.010},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Brand15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtFLM15,
author = {Andreas Brandst{\"{a}}dt and
Pavel Ficur and
Arne Leitert and
Martin Milanic},
title = {Polynomial-time algorithms for weighted efficient domination problems
in AT-free graphs and dually chordal graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {256--262},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.024},
doi = {10.1016/J.IPL.2014.09.024},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtFLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtG15,
author = {Andreas Brandst{\"{a}}dt and
Vassilis Giakoumakis},
title = {Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free
graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {345--350},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.019},
doi = {10.1016/J.IPL.2014.09.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Branzei15,
author = {Simina Br{\^{a}}nzei},
title = {A note on envy-free cake cutting with polynomial valuations},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {93--95},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.005},
doi = {10.1016/J.IPL.2014.07.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Branzei15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BravermanOV15,
author = {Vladimir Braverman and
Rafail Ostrovsky and
Gregory Vorsanger},
title = {Weighted sampling without replacement from data streams},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {923--926},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.007},
doi = {10.1016/J.IPL.2015.07.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BravermanOV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BulteauFRV15,
author = {Laurent Bulteau and
Guillaume Fertin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
title = {Some algorithmic results for [2]-sumset covers},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {1--5},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.008},
doi = {10.1016/J.IPL.2014.07.008},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BulteauFRV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cai15,
author = {Junqing Cai},
title = {A sufficient condition involving implicit degree and neighborhood
intersection for long cycles},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {225--227},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.015},
doi = {10.1016/J.IPL.2014.09.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cai15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CenWY15,
author = {Yue{-}Feng Cen and
Wanliang Wang and
Xin{-}Wei Yao},
title = {A fast {CU} depth decision mechanism for {HEVC}},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {719--724},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.001},
doi = {10.1016/J.IPL.2015.04.001},
timestamp = {Thu, 06 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CenWY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChasseinG15,
author = {Andr{\'{e}} B. Chassein and
Marc Goerigk},
title = {Alternative formulations for the ordered weighted averaging objective},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {604--608},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.008},
doi = {10.1016/J.IPL.2015.02.008},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChasseinG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenF15,
author = {Xue{-}Gang Chen and
Shinya Fujita},
title = {Downhill domination problem in graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {580--581},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.003},
doi = {10.1016/J.IPL.2015.02.003},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenL15,
author = {Xiang'en Chen and
Zepeng Li},
title = {Adjacent-vertex-distinguishing proper edge colorings of planar bipartite
graphs with {\(\Delta\)} = 9, 10, or 11},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {263--268},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.025},
doi = {10.1016/J.IPL.2014.09.025},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenW15,
author = {Jing Chen and
Xiuping Wang},
title = {Identification of Hammerstein systems with continuous nonlinearity},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {822--827},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.004},
doi = {10.1016/J.IPL.2015.06.004},
timestamp = {Mon, 15 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChenW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenYH15,
author = {Taolue Chen and
Nengkun Yu and
Tingting Han},
title = {Continuous-time orbit problems are decidable in polynomial-time},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {11--14},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.004},
doi = {10.1016/J.IPL.2014.08.004},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenYH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengHF15,
author = {Dongqin Cheng and
Rong{-}Xia Hao and
Yan{-}Quan Feng},
title = {Embedding even cycles on folded hypercubes with conditional faulty
edges},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {945--949},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.015},
doi = {10.1016/J.IPL.2015.07.015},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChengHF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChoNPS15,
author = {Sukhyeun Cho and
Joong Chae Na and
Kunsoo Park and
Jeong Seop Sim},
title = {A fast algorithm for order-preserving pattern matching},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {397--402},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.018},
doi = {10.1016/J.IPL.2014.10.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChoNPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChungP15,
author = {Yerim Chung and
Myoung{-}Ju Park},
title = {Notes on inverse bin-packing problems},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {60--68},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.005},
doi = {10.1016/J.IPL.2014.09.005},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChungP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cohen0Y15,
author = {Reuven Cohen and
Liran Katzir and
Aviv Yehezkel},
title = {A unified scheme for generalizing cardinality estimators to sum aggregation},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {336--342},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.009},
doi = {10.1016/J.IPL.2014.10.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cohen0Y15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ConstantinouNKS15,
author = {Eleni Constantinou and
Athanasios Naskos and
George Kakarontzas and
Ioannis Stamelos},
title = {Extracting reusable components: {A} semi-automated approach for complex
structures},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {414--417},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.007},
doi = {10.1016/J.IPL.2014.11.007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ConstantinouNKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CourtieuRTU15,
author = {Pierre Courtieu and
Lionel Rieg and
S{\'{e}}bastien Tixeuil and
Xavier Urbain},
title = {Impossibility of gathering, a certification},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {447--452},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.001},
doi = {10.1016/J.IPL.2014.11.001},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CourtieuRTU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Croitoru15,
author = {Cosmina Croitoru},
title = {A note on quasi-kernels in digraphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {863--865},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.017},
doi = {10.1016/J.IPL.2015.06.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Croitoru15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Darnstadt15,
author = {Malte Darnst{\"{a}}dt},
title = {The optimal {PAC} bound for intersection-closed concept classes},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {458--461},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.12.001},
doi = {10.1016/J.IPL.2014.12.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Darnstadt15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasDKNS15,
author = {Gautam K. Das and
Minati De and
Sudeshna Kolay and
Subhas C. Nandy and
Susmita Sur{-}Kolay},
title = {Approximation algorithms for maximum independent set of a unit disk
graph},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {439--446},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.002},
doi = {10.1016/J.IPL.2014.11.002},
timestamp = {Wed, 31 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DasDKNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Datta15,
author = {Alak Kumar Datta},
title = {Approximate spanning cactus},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {828--832},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.009},
doi = {10.1016/J.IPL.2015.06.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Datta15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DebskiGS15,
author = {Michal Debski and
Jaroslaw Grytczuk and
Malgorzata Sleszynska{-}Nowak},
title = {The strong chromatic index of sparse graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {326--330},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.006},
doi = {10.1016/J.IPL.2014.10.006},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DebskiGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DehghanS15,
author = {Ali Dehghan and
Mohammad{-}Reza Sadeghi},
title = {The complexity of the zero-sum 3-flows},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {316--320},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.004},
doi = {10.1016/J.IPL.2014.10.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DehghanS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Diaconescu15,
author = {Razvan Diaconescu},
title = {On the existence of translations of structured specifications},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {15--22},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.007},
doi = {10.1016/J.IPL.2014.08.007},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Diaconescu15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DietzfelbingerJ15,
author = {Martin Dietzfelbinger and
Raed Jaberi},
title = {On testing single connectedness in directed graphs and some related
problems},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {684--688},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.008},
doi = {10.1016/J.IPL.2015.04.008},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DietzfelbingerJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DongJZHL15,
author = {Jianming Dong and
Yiwei Jiang and
An Zhang and
Jueliang Hu and
Hui Luo},
title = {An approximation algorithm for proportionate scheduling in the two-stage
hybrid flow shop},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {475--480},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.014},
doi = {10.1016/J.IPL.2014.11.014},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DongJZHL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DongZA15,
author = {Qiang Dong and
Qian Zhao and
Ya{-}Hui An},
title = {The hamiltonicity of generalized honeycomb torus networks},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {104--111},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.011},
doi = {10.1016/J.IPL.2014.07.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DongZA15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DoronT15,
author = {Dean Doron and
Amnon Ta{-}Shma},
title = {On the de-randomization of space-bounded approximate counting problems},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {750--753},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.005},
doi = {10.1016/J.IPL.2015.03.005},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DoronT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DugarJRB15,
author = {Chetan Dugar and
Anuj Jain and
Amit Rajawat and
Swapan Bhattacharya},
title = {Dynamic pricing of call rates: Bayesian approach},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {237--242},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.020},
doi = {10.1016/J.IPL.2014.09.020},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DugarJRB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EisenbarthMS15,
author = {Thomas Eisenbarth and
Aaron Meyerowitz and
Rainer Steinwandt},
title = {On the security margin of {MAC} striping},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {899--902},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.009},
doi = {10.1016/J.IPL.2015.05.009},
timestamp = {Fri, 08 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/EisenbarthMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Elmasry15,
author = {Amr Elmasry},
title = {Counting inversions adaptively},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {769--772},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.003},
doi = {10.1016/J.IPL.2015.05.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Elmasry15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EnosZ15,
author = {Graham Enos and
Yuliang Zheng},
title = {An ID-based signcryption scheme with compartmented secret sharing
for unsigncryption},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {128--133},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.002},
doi = {10.1016/J.IPL.2014.08.002},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/EnosZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FeldmanT15,
author = {Michal Feldman and
Tami Tamir},
title = {Convergence of best-response dynamics in games with conflicting congestion
effects},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {112--118},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.012},
doi = {10.1016/J.IPL.2014.07.012},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FeldmanT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FernauHHMS15,
author = {Henning Fernau and
Pinar Heggernes and
Pim van 't Hof and
Daniel Meister and
Reza Saei},
title = {Computing the metric dimension for chain graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {671--676},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.006},
doi = {10.1016/J.IPL.2015.04.006},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FernauHHMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Finkel15,
author = {Olivier Finkel},
title = {The exact complexity of the infinite Post Correspondence Problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {609--611},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.009},
doi = {10.1016/J.IPL.2015.02.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Finkel15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FloderusLPS15,
author = {Peter Floderus and
Andrzej Lingas and
Mia Persson and
Dzmitry Sledneu},
title = {Detecting monomials with k distinct variables},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {82--86},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.003},
doi = {10.1016/J.IPL.2014.07.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FloderusLPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FlouriGKU15,
author = {Tom{\'{a}}s Flouri and
Emanuele Giaquinta and
Kassian Kobert and
Esko Ukkonen},
title = {Longest common substrings with k mismatches},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {643--647},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.006},
doi = {10.1016/J.IPL.2015.03.006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FlouriGKU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FournierIV15,
author = {Herv{\'{e}} Fournier and
Anas Ismail and
Antoine Vigneron},
title = {Computing the Gromov hyperbolicity of a discrete metric space},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {576--579},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.002},
doi = {10.1016/J.IPL.2015.02.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FournierIV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GaoL15,
author = {Xiaofang Gao and
Jiye Liang},
title = {An improved incremental nonlinear dimensionality reduction for isometric
data embedding},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {492--501},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.12.004},
doi = {10.1016/J.IPL.2014.12.004},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GaoL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GathenS15,
author = {Joachim von zur Gathen and
Igor E. Shparlinski},
title = {Circulant graphs and {GCD} and {LCM} of subsets},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {134--138},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.014},
doi = {10.1016/J.IPL.2014.07.014},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GathenS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GavalasKMPV15,
author = {Damianos Gavalas and
Charalampos Konstantopoulos and
Konstantinos Mastakas and
Grammati E. Pantziou and
Nikolaos Vathis},
title = {Approximation algorithms for the arc orienteering problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {313--315},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.003},
doi = {10.1016/J.IPL.2014.10.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GavalasKMPV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GelernterH15,
author = {Nethanel Gelernter and
Amir Herzberg},
title = {Gossip Latin square and the meet-all gossipers problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {738--743},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.001},
doi = {10.1016/J.IPL.2015.03.001},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GelernterH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GengY15,
author = {Zhichao Geng and
Jinjiang Yuan},
title = {A note on unbounded parallel-batch scheduling},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {969--974},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.002},
doi = {10.1016/J.IPL.2015.07.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GengY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GerstlMM15,
author = {Enrique Gerstl and
Baruch Mor and
Gur Mosheiov},
title = {A note: Maximizing the weighted number of just-in-time jobs on a proportionate
flowshop},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {159--162},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.004},
doi = {10.1016/J.IPL.2014.09.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GerstlMM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gorain015,
author = {Barun Gorain and
Partha Sarathi Mandal},
title = {Approximation algorithm for sweep coverage on graph},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {712--718},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.011},
doi = {10.1016/J.IPL.2015.03.011},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gorain015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gourves15,
author = {Laurent Gourv{\`{e}}s},
title = {Approximating the optimal sequence of acquisitions and sales with
a capped budget},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {760--764},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.001},
doi = {10.1016/J.IPL.2015.05.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gourves15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Grabowski15,
author = {Szymon Grabowski},
title = {A note on the longest common substring with k-mismatches problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {640--642},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.003},
doi = {10.1016/J.IPL.2015.03.003},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Grabowski15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrandoniKW15,
author = {Fabrizio Grandoni and
Tomasz Kociumaka and
Michal Wlodarczyk},
title = {An LP-rounding 2{\(\surd\)}2-approximation for restricted maximum
acyclic subgraph},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {182--185},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.008},
doi = {10.1016/J.IPL.2014.09.008},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GrandoniKW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Grolmusz15,
author = {Vince Grolmusz},
title = {A note on the PageRank of undirected graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {633--634},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.015},
doi = {10.1016/J.IPL.2015.02.015},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Grolmusz15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrzegorekJ15,
author = {Paulina Grzegorek and
Janusz Januszewski},
title = {A note on one-space bounded square packing},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {872--876},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.001},
doi = {10.1016/J.IPL.2015.06.001},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrzegorekJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoHC15,
author = {Jing{-}Ming Guo and
Chih{-}Hsien Hsia and
Chia{-}Hao Chang},
title = {{JPEG} false contour reduction using error diffusion},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {403--407},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.011},
doi = {10.1016/J.IPL.2014.11.011},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuoHC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoSY15,
author = {Jian Guo and
Chunhua Su and
Wun{-}She Yap},
title = {An improved preimage attack against {HAVAL-3}},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {386--393},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.016},
doi = {10.1016/J.IPL.2014.10.016},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuoSY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoZM15,
author = {Zhiwei Guo and
Haixing Zhao and
Yaping Mao},
title = {The equitable vertex arboricity of complete tripartite graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {977--982},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.016},
doi = {10.1016/J.IPL.2015.06.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuoZM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HaddadiCCG15,
author = {Salim Haddadi and
S. Chenche and
Meryem Cheraitia and
F. Guessoum},
title = {Polynomial-time local-improvement algorithm for Consecutive Block
Minimization},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {612--617},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.010},
doi = {10.1016/J.IPL.2015.02.010},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HaddadiCCG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HarnH15,
author = {Lein Harn and
Ching{-}Fang Hsu},
title = {Dynamic threshold secret reconstruction and its application to the
threshold cryptography},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {851--857},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.014},
doi = {10.1016/J.IPL.2015.06.014},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HarnH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HirschS15,
author = {Edward A. Hirsch and
Dmitry Sokolov},
title = {On the probabilistic closure of the loose unambiguous hierarchy},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {725--730},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.010},
doi = {10.1016/J.IPL.2015.04.010},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HirschS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HonkalaHL15,
author = {Iiro S. Honkala and
Olivier Hudry and
Antoine Lobstein},
title = {On the ensemble of optimal dominating and locating-dominating codes
in a graph},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {699--702},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.005},
doi = {10.1016/J.IPL.2015.04.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HonkalaHL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangYGZ15,
author = {Sheng Huang and
Dan Yang and
Yongxin Ge and
Xiaohong Zhang},
title = {Combined supervised information with {PCA} via discriminative component
selection},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {812--816},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.010},
doi = {10.1016/J.IPL.2015.06.010},
timestamp = {Fri, 29 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HuangYGZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HungCWH15,
author = {Chun{-}Nan Hung and
Eddie Cheng and
Tao{-}Ming Wang and
Lih{-}Hsing Hsu},
title = {On Hamiltonian properties of unidirectional hypercubes},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {551--555},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.006},
doi = {10.1016/J.IPL.2015.01.006},
timestamp = {Sat, 01 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HungCWH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IanniGR15,
author = {Miriam Di Ianni and
Luciano Gual{\`{a}} and
Gianluca Rossi},
title = {Reducing the diameter of a unit disk graph via node addition},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {845--850},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.015},
doi = {10.1016/J.IPL.2015.06.015},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IanniGR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IdalinoMCP15,
author = {Tha{\'{\i}}s Bardini Idalino and
Lucia Moura and
Ricardo Felipe Cust{\'{o}}dio and
Daniel Panario},
title = {Locating modifications in signed data for partial data integrity},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {731--737},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.014},
doi = {10.1016/J.IPL.2015.02.014},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IdalinoMCP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ImaiK15,
author = {Shigeyoshi Imai and
Kaoru Kurosawa},
title = {Improved reconstruction of {RSA} private-keys from their fraction},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {630--632},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.013},
doi = {10.1016/J.IPL.2015.02.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ImaiK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Indrzejczak15,
author = {Andrzej Indrzejczak},
title = {Eliminability of cut in hypersequent calculi for some modal logics
of linear frames},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {75--81},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.002},
doi = {10.1016/J.IPL.2014.07.002},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Indrzejczak15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IshiuK15,
author = {Tetsuya Ishiu and
Masashi Kikuchi},
title = {The termination of the higher-dimensional tarai functions},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {125--127},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.001},
doi = {10.1016/J.IPL.2014.08.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IshiuK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JaiswalKY15,
author = {Ragesh Jaiswal and
Mehul Kumar and
Pulkit Yadav},
title = {Improved analysis of D\({}^{\mbox{2}}\)-sampling based {PTAS} for
k-means and other clustering problems},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {100--103},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.009},
doi = {10.1016/J.IPL.2014.07.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JaiswalKY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JanczewskiT15,
author = {Robert Janczewski and
Krzysztof Turowski},
title = {The computational complexity of the backbone coloring problem for
bounded-degree graphs with connected backbones},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {232--236},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.018},
doi = {10.1016/J.IPL.2014.09.018},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JanczewskiT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JannatiF15,
author = {Hoda Jannati and
Abolfazl Falahati},
title = {Analysis of false-reject probability in distance bounding protocols
with mixed challenges over {RFID} noisy communication channel},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {623--629},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.012},
doi = {10.1016/J.IPL.2015.02.012},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JannatiF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jha15,
author = {Pranava K. Jha},
title = {A comment on "The domination number of exchanged hypercubes"},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {343--344},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.016},
doi = {10.1016/J.IPL.2014.09.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jha15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JiaSZC15,
author = {Tong Jia and
Yan Shi and
ZhongXuan Zhou and
Dongyue Chen},
title = {3D depth information extraction with omni-directional camera},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {285--291},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.029},
doi = {10.1016/J.IPL.2014.09.029},
timestamp = {Thu, 26 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JiaSZC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JourdanUY15,
author = {Guy{-}Vincent Jourdan and
Hasan Ural and
H{\"{u}}sn{\"{u}} Yenig{\"{u}}n},
title = {Reduced checking sequences using unreliable reset},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {532--535},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.002},
doi = {10.1016/J.IPL.2015.01.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JourdanUY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KaiserSC15,
author = {Tom{\'{a}}s Kaiser and
Maria Saumell and
Nico Van Cleemput},
title = {10-Gabriel graphs are Hamiltonian},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {877--881},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.013},
doi = {10.1016/J.IPL.2015.05.013},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KaiserSC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kakugawa15,
author = {Hirotsugu Kakugawa},
title = {On the family of critical section problems},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {28--32},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.012},
doi = {10.1016/J.IPL.2014.08.012},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Kakugawa15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kakugawa15a,
author = {Hirotsugu Kakugawa},
title = {Self-stabilizing distributed algorithm for local mutual inclusion},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {562--569},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.008},
doi = {10.1016/J.IPL.2015.01.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kakugawa15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KamiyamaK15,
author = {Naoyuki Kamiyama and
Yasushi Kawase},
title = {On packing arborescences in temporal networks},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {321--325},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.005},
doi = {10.1016/J.IPL.2014.10.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KamiyamaK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KarakocDH15,
author = {Ferhat Karako{\c{c}} and
H{\"{u}}seyin Demirci and
A. Emre Harmanci},
title = {{AKF:} {A} key alternating Feistel scheme for lightweight cipher designs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {359--367},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.010},
doi = {10.1016/J.IPL.2014.10.010},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KarakocDH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KarandikarKS15,
author = {Prateek Karandikar and
Manfred Kufleitner and
Philippe Schnoebelen},
title = {On the index of Simon's congruence for piecewise testability},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {515--519},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.008},
doi = {10.1016/J.IPL.2014.11.008},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KarandikarKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KiralyK15,
author = {Zolt{\'{a}}n Kir{\'{a}}ly and
Erika R. Kov{\'{a}}cs},
title = {Randomized and deterministic algorithms for network coding problems
in wireless networks},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {507--511},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.012},
doi = {10.1016/J.IPL.2014.11.012},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KiralyK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kobayashi15,
author = {Yasuaki Kobayashi},
title = {Computing the pathwidth of directed graphs with small vertex cover},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {310--312},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.002},
doi = {10.1016/J.IPL.2014.10.002},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kobayashi15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KovacsMMN15,
author = {Annam{\'{a}}ria Kov{\'{a}}cs and
Ulrich Meyer and
Gabriel Moruz and
Andrei Negoescu},
title = {The optimal structure of algorithms for {\(\alpha\)}-paging},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {932--938},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.011},
doi = {10.1016/J.IPL.2015.07.011},
timestamp = {Tue, 25 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KovacsMMN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LadinekZ15,
author = {Irena Hrastnik Ladinek and
Janez Zerovnik},
title = {Perfect codes in direct graph bundles},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {707--711},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.010},
doi = {10.1016/J.IPL.2015.03.010},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LadinekZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LambertMU15,
author = {Thomas Lambert and
Loris Marchal and
Bora U{\c{c}}ar},
title = {Comments on the hierarchically structured bin packing problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {306--309},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.001},
doi = {10.1016/J.IPL.2014.10.001},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LambertMU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Li15,
author = {Mengjun Li},
title = {Automatic proving or disproving equality loop invariants based on
finite difference techniques},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {468--474},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.006},
doi = {10.1016/J.IPL.2014.11.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Li15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiSZX15,
author = {Zepeng Li and
Zehui Shao and
Enqiang Zhu and
Jin Xu},
title = {A note on local coloring of graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {302--305},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.032},
doi = {10.1016/J.IPL.2014.09.032},
timestamp = {Wed, 08 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiSZX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiangS15,
author = {Zuosong Liang and
Erfang Shan},
title = {The clique-transversal set problem in claw-free graphs with degree
at most 4},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {331--335},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.008},
doi = {10.1016/J.IPL.2014.10.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiangS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LienKF15,
author = {Min{-}Yun Lien and
Jyhmin Kuo and
Hung{-}Lin Fu},
title = {On the decycling number of generalized Kautz digraphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {209--211},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.013},
doi = {10.1016/J.IPL.2014.09.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LienKF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinLW15,
author = {Chiou{-}Jiun Lin and
Jia Jie Liu and
Yue{-}Li Wang},
title = {Finding outer-connected dominating sets in interval graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {917--922},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.008},
doi = {10.1016/J.IPL.2015.07.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinLW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinSS15,
author = {Min Chih Lin and
Francisco J. Soulignac and
Jayme Luiz Szwarcfiter},
title = {A faster algorithm for the cluster editing problem on proper interval
graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {913--916},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.009},
doi = {10.1016/J.IPL.2015.07.009},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinT15,
author = {Min{-}Sheng Lin and
Chao{-}Chun Ting},
title = {A polynomial-time algorithm for computing K-terminal residual reliability
of d-trapezoid graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {371--376},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.013},
doi = {10.1016/J.IPL.2014.10.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinT15a,
author = {Min{-}Sheng Lin and
Chao{-}Chun Ting},
title = {Computing the K-terminal reliability of directed path graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {773--778},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.005},
doi = {10.1016/J.IPL.2015.05.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinT15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinV15,
author = {Min Chih Lin and
Saveliy Vasiliev},
title = {Approximation algorithms for clique transversals on some graph classes},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {667--670},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.003},
doi = {10.1016/J.IPL.2015.04.003},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Liu15,
author = {Yu{-}Liang Liu},
title = {Routing and wavelength assignment for exchanged hypercubes in linear
array optical networks},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {203--208},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.012},
doi = {10.1016/J.IPL.2014.09.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Liu15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lu15,
author = {Daniel L. Lu},
title = {Planar lower envelope of monotone polygonal chains},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {962--964},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.004},
doi = {10.1016/J.IPL.2015.07.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Lu15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuM15,
author = {Zaiping Lu and
Yingbin Ma},
title = {Rainbow 2-Connection Numbers of Cayley Graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {486--491},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.12.007},
doi = {10.1016/J.IPL.2014.12.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lucas15,
author = {Salvador Lucas},
title = {Completeness of context-sensitive rewriting},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {87--92},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.004},
doi = {10.1016/J.IPL.2014.07.004},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lucas15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuoJ15,
author = {Wenchang Luo and
Min Ji},
title = {Scheduling a variable maintenance and linear deteriorating jobs on
a single machine},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {33--39},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.011},
doi = {10.1016/J.IPL.2014.08.011},
timestamp = {Fri, 26 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuoJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/M15,
author = {Jagadish M},
title = {An approximation algorithm for the cutting-sticks problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {170--174},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.007},
doi = {10.1016/J.IPL.2014.09.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/M15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MagiriusMP15,
author = {Marco Magirius and
Martin Mundhenk and
Raphaela Palenta},
title = {The complexity of primal logic with disjunction},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {536--542},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.003},
doi = {10.1016/J.IPL.2015.01.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MagiriusMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MapaU15,
author = {S{\'{\i}}lvia Maria Santana Mapa and
Sebasti{\'{a}}n Urrutia},
title = {On the maximum acyclic subgraph problem under disjunctive constraints},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {119--124},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.013},
doi = {10.1016/J.IPL.2014.07.013},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MapaU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MarencoMS15,
author = {Javier Marenco and
Marcelo Mydlarz and
Daniel E. Sever{\'{\i}}n},
title = {Topological additive numbering of directed acyclic graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {199--202},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.011},
doi = {10.1016/J.IPL.2014.09.011},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MarencoMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Massberg15,
author = {Jens Ma{\ss}berg},
title = {Generalized Huffman coding for binary trees with choosable edge lengths},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {502--506},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.013},
doi = {10.1016/J.IPL.2014.11.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Massberg15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MathewO15,
author = {K. Ashik Mathew and
Patric R. J. {\"{O}}sterg{\aa}rd},
title = {On hypercube packings, blocking sets and a covering problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {141--145},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.005},
doi = {10.1016/J.IPL.2014.08.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MathewO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Matsubara15,
author = {Shunichi Matsubara},
title = {An enumeration algorithm for all integers nonrepresentable by some
positive integers},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {280--284},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.028},
doi = {10.1016/J.IPL.2014.09.028},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Matsubara15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MavronicolasM15,
author = {Marios Mavronicolas and
Burkhard Monien},
title = {The complexity of pure equilibria in mix-weighted congestion games
on parallel links},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {927--931},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.012},
doi = {10.1016/J.IPL.2015.07.012},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MavronicolasM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MengZ15,
author = {Xianmeng Meng and
Xuexin Zheng},
title = {Cryptanalysis of {RSA} with a small parameter revisited},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {858--862},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.013},
doi = {10.1016/J.IPL.2015.06.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MengZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MerouaneC15,
author = {Houcine Boumediene Merouane and
Mustapha Chellali},
title = {On Secure Domination in Graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {786--790},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.006},
doi = {10.1016/J.IPL.2015.05.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MerouaneC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Meshram15,
author = {Chandrashekhar Meshram},
title = {An efficient ID-based cryptographic encryption based on discrete logarithm
problem and integer factorization problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {351--358},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.007},
doi = {10.1016/J.IPL.2014.10.007},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Meshram15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MesnardP15,
author = {Fred Mesnard and
{\'{E}}tienne Payet},
title = {A second-order formulation of non-termination},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {882--885},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.012},
doi = {10.1016/J.IPL.2015.05.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MesnardP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Milshtein15,
author = {Moshe Milshtein},
title = {A new binary code of length 16 and minimum distance 3},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {975--976},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.001},
doi = {10.1016/J.IPL.2015.07.001},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Milshtein15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Misra15,
author = {Jayadev Misra},
title = {Mapping among the nodes of infinite trees: {A} variation of K{\H{o}}nig's
infinity lemma},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {548--549},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.005},
doi = {10.1016/J.IPL.2015.01.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Misra15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MkrtchyanS15,
author = {Vahan Mkrtchyan and
K. Subramani},
title = {On the approximability of the Largest Sphere Rule Ensemble Classification
problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {833--837},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.012},
doi = {10.1016/J.IPL.2015.06.012},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MkrtchyanS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Momke15,
author = {Tobias M{\"{o}}mke},
title = {An improved approximation algorithm for the traveling salesman problem
with relaxed triangle inequality},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {866--871},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.003},
doi = {10.1016/J.IPL.2015.06.003},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Momke15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MomtaziN15,
author = {Saeedeh Momtazi and
Felix Naumann},
title = {Who wants a computer to be a millionaire?},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {481--485},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.12.005},
doi = {10.1016/J.IPL.2014.12.005},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MomtaziN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Monnot15,
author = {J{\'{e}}r{\^{o}}me Monnot},
title = {A note on the traveling salesman reoptimization problem under vertex
insertion},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {435--438},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.003},
doi = {10.1016/J.IPL.2014.11.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Monnot15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MorM15,
author = {Baruch Mor and
Gur Mosheiov},
title = {A note: Minimizing maximum earliness on a proportionate flowshop},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {253--255},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.023},
doi = {10.1016/J.IPL.2014.09.023},
timestamp = {Sat, 30 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MorM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NakashimaIIBT15,
author = {Yuto Nakashima and
Tomohiro I and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda},
title = {Constructing {LZ78} tries and position heaps in linear time for large
alphabets},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {655--659},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.002},
doi = {10.1016/J.IPL.2015.04.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NakashimaIIBT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NanasiVB15,
author = {Michal N{\'{a}}n{\'{a}}si and
Tom{\'{a}}s Vinar and
Brona Brejov{\'{a}}},
title = {Sequence annotation with HMMs: New problems and their complexity},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {635--639},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.002},
doi = {10.1016/J.IPL.2015.03.002},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NanasiVB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nandi15,
author = {Mrinal Nandi},
title = {On commutativity of Discrete Fourier Transform},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {779--785},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.011},
doi = {10.1016/J.IPL.2015.04.011},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Nandi15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NeggaziHK15,
author = {Brahim Neggazi and
Mohammed Haddad and
Hamamache Kheddouci},
title = {A new self-stabilizing algorithm for maximal p-star decomposition
of general graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {892--898},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.010},
doi = {10.1016/J.IPL.2015.05.010},
timestamp = {Fri, 08 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NeggaziHK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NiLXX15,
author = {Guanqun Ni and
Li Luo and
Yin{-}Feng Xu and
Jiuping Xu},
title = {Optimal online markdown and markup pricing policies with demand uncertainty},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {804--811},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.006},
doi = {10.1016/J.IPL.2015.06.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NiLXX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ning15,
author = {Bo Ning},
title = {Notes on a conjecture of Manoussakis concerning Hamilton cycles in
digraphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {221--224},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.015},
doi = {10.1016/J.IPL.2014.08.015},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ning15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NingFW15,
author = {Wantao Ning and
Xiaoli Feng and
Ling Wang},
title = {The connectivity of exchanged crossed cube},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {394--396},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.017},
doi = {10.1016/J.IPL.2014.10.017},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NingFW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PangWCZL15,
author = {Chaoyi Pang and
Junhu Wang and
Yu Cheng and
Hao Lan Zhang and
Tongliang Li},
title = {Topological sorts on DAGs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {298--301},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.031},
doi = {10.1016/J.IPL.2014.09.031},
timestamp = {Mon, 06 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PangWCZL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pasalic15,
author = {Enes Pasalic},
title = {A note on nonexistence of vectorial bent functions with binomial trace
representation in the PS\({}^{\mbox{-}}\) class},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {139--140},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.003},
doi = {10.1016/J.IPL.2014.08.003},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pasalic15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pasalic15a,
author = {Enes Pasalic},
title = {Corrigendum to "A note on nonexistence of vectorial bent functions
with binomial trace representation in the PS\({}^{\mbox{-}}\) class"
[Information Processing Letters 115 {(2)} {(2015)} 139-140]},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {520},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.12.006},
doi = {10.1016/J.IPL.2014.12.006},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pasalic15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Peltomaki15,
author = {Jarkko Peltom{\"{a}}ki},
title = {Characterization of repetitions in Sturmian words: {A} new proof},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {886--891},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.011},
doi = {10.1016/J.IPL.2015.05.011},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Peltomaki15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Piestrak15,
author = {Stanislaw J. Piestrak},
title = {A note on {RNS} architectures for the implementation of the diagonal
function},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {453--457},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.12.003},
doi = {10.1016/J.IPL.2014.12.003},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Piestrak15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/QueyroiK15,
author = {Fran{\c{c}}ois Queyroi and
Sergey Kirgizov},
title = {Suppression distance computation for hierarchical clusterings},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {689--693},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.007},
doi = {10.1016/J.IPL.2015.04.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/QueyroiK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RistovK15,
author = {Strahil Ristov and
Damir Korencic},
title = {Using static suffix array in dynamic application: Case of text compression
by longest first substitution},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {175--181},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.014},
doi = {10.1016/J.IPL.2014.08.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RistovK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RottelerS15,
author = {Martin R{\"{o}}tteler and
Rainer Steinwandt},
title = {A note on quantum related-key attacks},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {40--44},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.009},
doi = {10.1016/J.IPL.2014.08.009},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RottelerS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SaettlerLC15,
author = {Aline Medeiros Saettler and
Eduardo Sany Laber and
Ferdinando Cicalese},
title = {Approximating decision trees with value dependent testing costs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {594--599},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.006},
doi = {10.1016/J.IPL.2015.02.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SaettlerLC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schaudt15,
author = {Oliver Schaudt},
title = {On disjoint maximal independent sets in graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {23--27},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.010},
doi = {10.1016/J.IPL.2014.08.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schaudt15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ScottSS15,
author = {Allan Scott and
Srinivasan Venkatesh and
Ulrike Stege},
title = {k-Attribute-Anonymity is hard even for k=2},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {368--370},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.011},
doi = {10.1016/J.IPL.2014.10.011},
timestamp = {Thu, 21 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ScottSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShaoY15,
author = {Zhi{-}Yi Shao and
Bo Yang},
title = {On security against the server in designated tester public key encryption
with keyword search},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {957--961},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.006},
doi = {10.1016/J.IPL.2015.07.006},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShaoY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShiauSW15,
author = {Alexander Chane Shiau and
Tzong{-}Huei Shiau and
Yue{-}Li Wang},
title = {Incidence coloring of Cartesian product graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {765--768},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.002},
doi = {10.1016/J.IPL.2015.05.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShiauSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shin15,
author = {Kilho Shin},
title = {Tree Edit Distance and Maximum Agreement Subtree},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {69--73},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.002},
doi = {10.1016/J.IPL.2014.09.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shin15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SongWLX15,
author = {Yafei Song and
Xiaodan Wang and
Lei Lei and
Yaqiong Xing},
title = {Credibility decay model in temporal evidence combination},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {248--252},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.022},
doi = {10.1016/J.IPL.2014.09.022},
timestamp = {Wed, 05 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SongWLX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SongY15,
author = {Yinglei Song and
Menghong Yu},
title = {On finding the longest antisymmetric path in directed acyclic graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {377--381},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.014},
doi = {10.1016/J.IPL.2014.10.014},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SongY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ThakkarK15,
author = {Jay Thakkar and
Aditya Kanade},
title = {Non-deterministic transducer models of retransmission protocols over
noisy channels},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {694--698},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.009},
doi = {10.1016/J.IPL.2015.04.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ThakkarK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tian15,
author = {Miaomiao Tian},
title = {Identity-based proxy re-signatures from lattices},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {462--467},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.12.002},
doi = {10.1016/J.IPL.2014.12.002},
timestamp = {Fri, 14 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tian15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TocaA15,
author = {Cosme Ernesto Santiesteban{-}Toca and
Jes{\'{u}}s S. Aguilar{-}Ruiz},
title = {A new multiple classifier system for the prediction of protein's contacts
map},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {983--990},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.008},
doi = {10.1016/J.IPL.2015.06.008},
timestamp = {Thu, 31 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TocaA15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsai15,
author = {Chang{-}Hsiung Tsai},
title = {The pessimistic diagnosability of alternating group graphs under the
{PMC} model},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {151--154},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.003},
doi = {10.1016/J.IPL.2014.09.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsai15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TsengVB15,
author = {Lewis Tseng and
Nitin H. Vaidya and
Vartika Bhandari},
title = {Broadcast using certified propagation algorithm in presence of Byzantine
faults},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {512--514},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.010},
doi = {10.1016/J.IPL.2014.11.010},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TsengVB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tu15,
author = {Jianhua Tu},
title = {A fixed-parameter algorithm for the vertex cover P\({}_{\mbox{3}}\)
problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {96--99},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.06.018},
doi = {10.1016/J.IPL.2014.06.018},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tu15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VeanesB15,
author = {Margus Veanes and
Nikolaj S. Bj{\o}rner},
title = {Symbolic tree automata},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {418--424},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.005},
doi = {10.1016/J.IPL.2014.11.005},
timestamp = {Thu, 14 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VeanesB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VecchioL15,
author = {Massimo Vecchio and
Roberto L{\'{o}}pez{-}Valcarce},
title = {A greedy topology design to accelerate consensus in broadcast wireless
sensor networks},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {408--413},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.009},
doi = {10.1016/J.IPL.2014.11.009},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VecchioL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vrgoc15,
author = {Domagoj Vrgoc},
title = {Using variable automata for querying data graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {425--430},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.019},
doi = {10.1016/J.IPL.2014.10.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vrgoc15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangWZ15,
author = {Yanning Wang and
Yanyan Wang and
Xuguang Zhang},
title = {Note on property M(k) of some complete multipartite graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {228--231},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.017},
doi = {10.1016/J.IPL.2014.09.017},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WangWZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WatelWBB15,
author = {Dimitri Watel and
Marc{-}Antoine Weisser and
C{\'{e}}dric Bentz and
Dominique Barth},
title = {An {FPT} algorithm in polynomial space for the Directed Steiner Tree
problem with Limited number of Diffusing nodes},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {275--279},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.027},
doi = {10.1016/J.IPL.2014.09.027},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WatelWBB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuCJ15,
author = {Yong Wu and
T. C. E. Cheng and
Min Ji},
title = {Inefficiency of the Nash equilibrium for selfish machine covering
on two hierarchical uniform machines},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {838--844},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.005},
doi = {10.1016/J.IPL.2015.06.005},
timestamp = {Fri, 26 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuCJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XingS15,
author = {Huaming Xing and
Moo Young Sohn},
title = {Bounds on locating total domination number of the Cartesian product
of cycles and paths},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {950--956},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.010},
doi = {10.1016/J.IPL.2015.07.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XingS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuL15,
author = {Yinfeng Xu and
Hongmei Li},
title = {Minimax regret 1-sink location problem in dynamic cycle networks},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {163--169},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.006},
doi = {10.1016/J.IPL.2014.09.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XuL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuZW15,
author = {Chuandong Xu and
Shenggui Zhang and
Yi Wang},
title = {On the maximum arc-chromatic number of digraphs with bounded outdegrees
or indegrees},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {939--944},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.013},
doi = {10.1016/J.IPL.2015.07.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XuZW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangTYZ15,
author = {Hao Yang and
Keming Tang and
Jianjiang Yu and
Licai Zhu},
title = {A practical information coverage approach in wireless sensor network},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {6--10},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.006},
doi = {10.1016/J.IPL.2014.07.006},
timestamp = {Thu, 17 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangTYZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangWL15,
author = {Yuxing Yang and
Shiying Wang and
Jing Li},
title = {Subnetwork preclusion for bubble-sort networks},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {817--821},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.011},
doi = {10.1016/J.IPL.2015.06.011},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YangWL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YazdiBMK15,
author = {Ehsan Najafi Yazdi and
Alireza Bagheri and
Zahra Moezkarimi and
Hamidreza Keshavarz},
title = {An O(1)-approximation algorithm for the 2-dimensional geometric freeze-tag
problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {618--622},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.011},
doi = {10.1016/J.IPL.2015.02.011},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YazdiBMK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuanK15,
author = {Chen Yuan and
Haibin Kan},
title = {A refined analysis on the jump number problem of interval orders},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {797--800},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.002},
doi = {10.1016/J.IPL.2015.06.002},
timestamp = {Sat, 25 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YuanK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangQJGY15,
author = {Yunong Zhang and
Binbin Qiu and
Long Jin and
Dongsheng Guo and
Zhi Yang},
title = {Infinitely many Zhang functions resulting in various {ZNN} models
for time-varying matrix inversion with link to Drazin inverse},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {703--706},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.007},
doi = {10.1016/J.IPL.2015.03.007},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangQJGY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangYL15,
author = {Hailiang Zhang and
Guanglong Yu and
Shanlin Li},
title = {Graphs with six distinct matching roots},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {521--526},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.012},
doi = {10.1016/J.IPL.2014.10.012},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangYL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangZZ15,
author = {Yan Zhang and
Zhaohui Zhu and
Jinjin Zhang},
title = {On the greatest solution of equations in CLL\({}_{\mbox{R}}\)},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {903--907},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.008},
doi = {10.1016/J.IPL.2015.05.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangZZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhaoH15,
author = {Shuhuan Zhao and
Zheng{-}ping Hu},
title = {A modular weighted sparse representation based on Fisher discriminant
and sparse residual for face recognition with occlusion},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {677--683},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.004},
doi = {10.1016/J.IPL.2015.04.004},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhaoH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zhou15,
author = {Xue Zhou},
title = {A new lower bound for the number of perfect matchings of line graph},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {269--274},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.026},
doi = {10.1016/J.IPL.2014.09.026},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zhou15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuLSXL15,
author = {Enqiang Zhu and
Zepeng Li and
Zehui Shao and
Jin Xu and
Chanjuan Liu},
title = {Tree-core and tree-coritivity of graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {754--759},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.016},
doi = {10.1016/J.IPL.2015.02.016},
timestamp = {Wed, 08 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhuLSXL15.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-04-24 06:30 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:
