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/ipl112.bht:"
download as .bib file
@article{DBLP:journals/ipl/AbregoCLS12,
author = {Bernardo M. {\'{A}}brego and
Mario Cetina and
Jes{\'{u}}s Lea{\~{n}}os and
Gelasio Salazar},
title = {Visibility-preserving convexifications using single-vertex moves},
journal = {Inf. Process. Lett.},
volume = {112},
number = {5},
pages = {161--163},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.012},
doi = {10.1016/J.IPL.2011.11.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AbregoCLS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Agrawal12,
author = {Shashank Agrawal},
title = {Verifiable secret sharing in a total of three rounds},
journal = {Inf. Process. Lett.},
volume = {112},
number = {22},
pages = {856--859},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.003},
doi = {10.1016/J.IPL.2012.08.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Agrawal12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AhadiDKM12,
author = {Arash Ahadi and
Ali Dehghan and
Mohammad Reza Kazemi and
E. Mollaahmadi},
title = {Computation of lucky number of planar graphs is NP-hard},
journal = {Inf. Process. Lett.},
volume = {112},
number = {4},
pages = {109--112},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.002},
doi = {10.1016/J.IPL.2011.11.002},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AhadiDKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AkshayGHY12,
author = {S. Akshay and
Blaise Genest and
Lo{\"{\i}}c H{\'{e}}lou{\"{e}}t and
Shaofa Yang},
title = {Regular set of representatives for time-constrained {MSC} graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {14-15},
pages = {592--598},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.002},
doi = {10.1016/J.IPL.2012.05.002},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AkshayGHY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AkutsuMT12,
author = {Tatsuya Akutsu and
Avraham A. Melkman and
Takeyuki Tamura},
title = {Singleton and 2-periodic attractors of sign-definite Boolean networks},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {35--38},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.002},
doi = {10.1016/J.IPL.2011.10.002},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AkutsuMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlonW12,
author = {Noga Alon and
Amit Weinstein},
title = {Local correction of juntas},
journal = {Inf. Process. Lett.},
volume = {112},
number = {6},
pages = {223--226},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.005},
doi = {10.1016/J.IPL.2011.12.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlonW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AmanC12,
author = {Bogdan Aman and
Gabriel Ciobanu},
title = {Properties of enhanced mobile membranes via coloured Petri nets},
journal = {Inf. Process. Lett.},
volume = {112},
number = {6},
pages = {243--248},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.003},
doi = {10.1016/J.IPL.2011.12.003},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AmanC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AmbainisY12,
author = {Andris Ambainis and
Abuzer Yakaryilmaz},
title = {Superiority of exact quantum automata for promise problems},
journal = {Inf. Process. Lett.},
volume = {112},
number = {7},
pages = {289--291},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.001},
doi = {10.1016/J.IPL.2012.01.001},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AmbainisY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AspnesY12,
author = {James Aspnes and
Yitong Yin},
title = {Randomized load balancing by joining and splitting bins},
journal = {Inf. Process. Lett.},
volume = {112},
number = {8-9},
pages = {309--313},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.003},
doi = {10.1016/J.IPL.2012.01.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AspnesY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AwasthiBS12,
author = {Pranjal Awasthi and
Avrim Blum and
Or Sheffet},
title = {Center-based clustering under perturbation stability},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {49--54},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.006},
doi = {10.1016/J.IPL.2011.10.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AwasthiBS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BannaiGIILL12,
author = {Hideo Bannai and
Travis Gagie and
Tomohiro I and
Shunsuke Inenaga and
Gad M. Landau and
Moshe Lewenstein},
title = {An efficient algorithm to test square-freeness of strings compressed
by straight-line programs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {19},
pages = {711--714},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.017},
doi = {10.1016/J.IPL.2012.06.017},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BannaiGIILL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaoL12,
author = {Xiaoguang Bao and
Zhaohui Liu},
title = {An improved approximation algorithm for the clustered traveling salesman
problem},
journal = {Inf. Process. Lett.},
volume = {112},
number = {23},
pages = {908--910},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.020},
doi = {10.1016/J.IPL.2012.08.020},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BaoL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaranyB12,
author = {Vince B{\'{a}}r{\'{a}}ny and
Mikolaj Bojanczyk},
title = {Finite satisfiability for guarded fixpoint logic},
journal = {Inf. Process. Lett.},
volume = {112},
number = {10},
pages = {371--375},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.005},
doi = {10.1016/J.IPL.2012.02.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaranyB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarretoVF12,
author = {Jo{\~{a}}o Pedro Barreto and
Lu{\'{\i}}s Veiga and
Paulo Ferreira},
title = {Hash challenges: Stretching the limits of compare-by-hash in distributed
data deduplication},
journal = {Inf. Process. Lett.},
volume = {112},
number = {10},
pages = {380--385},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.012},
doi = {10.1016/J.IPL.2012.01.012},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BarretoVF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Barrus12,
author = {Michael D. Barrus},
title = {Havel-Hakimi residues of unigraphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {44--48},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.011},
doi = {10.1016/J.IPL.2011.10.011},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Barrus12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaudonPW12,
author = {Olivier Baudon and
Jakub Przybylo and
Mariusz Wozniak},
title = {On minimal arbitrarily partitionable graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {17-18},
pages = {697--700},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.010},
doi = {10.1016/J.IPL.2012.06.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaudonPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaumeisterR12,
author = {Dorothea Baumeister and
J{\"{o}}rg Rothe},
title = {Taking the final step to a full dichotomy of the possible winner problem
in pure scoring rules},
journal = {Inf. Process. Lett.},
volume = {112},
number = {5},
pages = {186--190},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.016},
doi = {10.1016/J.IPL.2011.11.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BaumeisterR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bereg12,
author = {Sergey Bereg},
title = {Computing generalized ham-sandwich cuts},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {532--534},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.013},
doi = {10.1016/J.IPL.2012.03.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bereg12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BerwangerS12,
author = {Dietmar Berwanger and
Olivier Serre},
title = {Parity games on undirected graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {23},
pages = {928--932},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.021},
doi = {10.1016/J.IPL.2012.08.021},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BerwangerS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BinucciBBDGPPSZ12,
author = {Carla Binucci and
Ulrik Brandes and
Giuseppe Di Battista and
Walter Didimo and
Marco Gaertler and
Pietro Palladino and
Maurizio Patrignani and
Antonios Symvonis and
Katharina Anna Zweig},
title = {Drawing trees in a streaming model},
journal = {Inf. Process. Lett.},
volume = {112},
number = {11},
pages = {418--422},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.011},
doi = {10.1016/J.IPL.2012.02.011},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BinucciBBDGPPSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlinBDS12,
author = {Guillaume Blin and
Paola Bonizzoni and
Riccardo Dondi and
Florian Sikora},
title = {On the parameterized complexity of the repetition free longest common
subsequence problem},
journal = {Inf. Process. Lett.},
volume = {112},
number = {7},
pages = {272--276},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.009},
doi = {10.1016/J.IPL.2011.12.009},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BlinBDS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BorowieckiGP12,
author = {Mieczyslaw Borowiecki and
Jaroslaw Grytczuk and
Monika Pilsniak},
title = {Coloring chip configurations on graphs and digraphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {1--4},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.09.011},
doi = {10.1016/J.IPL.2011.09.011},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BorowieckiGP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BotelhoWZ12,
author = {Fabiano C. Botelho and
Nicholas C. Wormald and
Nivio Ziviani},
title = {Cores of random r-partite hypergraphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {8-9},
pages = {314--319},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.017},
doi = {10.1016/J.IPL.2011.10.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BotelhoWZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtG12,
author = {Andreas Brandst{\"{a}}dt and
Vassilis Giakoumakis},
title = {Maximum Weight Independent Sets in hole- and co-chair-free graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {3},
pages = {67--71},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.09.015},
doi = {10.1016/J.IPL.2011.09.015},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BravoKNPS12,
author = {Raquel S. F. Bravo and
Sulamita Klein and
Loana Tito Nogueira and
F{\'{a}}bio Protti and
Rudini Menezes Sampaio},
title = {Partitioning extended P\({}_{\mbox{4}}\)-laden graphs into cliques
and stable sets},
journal = {Inf. Process. Lett.},
volume = {112},
number = {21},
pages = {829--834},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.011},
doi = {10.1016/J.IPL.2012.07.011},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BravoKNPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Breugel12,
author = {Franck van Breugel},
title = {On behavioural pseudometrics and closure ordinals},
journal = {Inf. Process. Lett.},
volume = {112},
number = {19},
pages = {715--718},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.019},
doi = {10.1016/J.IPL.2012.06.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Breugel12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CaiXY12,
author = {Chunli Cai and
Dezheng Xie and
Wenjuan Yang},
title = {A result on linear coloring of planar graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {22},
pages = {880--884},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.016},
doi = {10.1016/J.IPL.2012.07.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CaiXY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chakrabarti12,
author = {Amit Chakrabarti},
title = {A note on randomized streaming space bounds for the longest increasing
subsequence problem},
journal = {Inf. Process. Lett.},
volume = {112},
number = {7},
pages = {261--263},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.008},
doi = {10.1016/J.IPL.2011.12.008},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chakrabarti12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangC12,
author = {Chia{-}Jung Chang and
Kun{-}Mao Chao},
title = {Efficient algorithms for local ranking},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {517--522},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.011},
doi = {10.1016/J.IPL.2012.03.011},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChawachatFJ12,
author = {Jakarin Chawachat and
Jittat Fakcharoenphol and
Wattana Jindaluang},
title = {The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem
with an application in {P2P} networking},
journal = {Inf. Process. Lett.},
volume = {112},
number = {24},
pages = {937--941},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.015},
doi = {10.1016/J.IPL.2012.08.015},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChawachatFJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen12,
author = {Xie{-}Bin Chen},
title = {Paired many-to-many disjoint path covers of hypercubes with faulty
edges},
journal = {Inf. Process. Lett.},
volume = {112},
number = {3},
pages = {61--66},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.010},
doi = {10.1016/J.IPL.2011.10.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenLM12,
author = {Xing Chen and
Juan Liu and
Jixiang Meng},
title = {{\(\lambda\)}-Optimality of Bipartite Digraphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {17-18},
pages = {701--705},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.003},
doi = {10.1016/J.IPL.2012.05.003},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenQ12,
author = {Hong{-}Yu Chen and
Jian{-}Ming Qi},
title = {The linear arboricity of planar graphs with maximum degree at least
5},
journal = {Inf. Process. Lett.},
volume = {112},
number = {20},
pages = {767--771},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.007},
doi = {10.1016/J.IPL.2012.06.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenQ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengCXW12,
author = {Qiang Cheng and
Feng Chen and
Wenli Xu and
Song Wang},
title = {Recursive sum-product algorithm for generalized outer-planar graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {11},
pages = {449--456},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.001},
doi = {10.1016/J.IPL.2012.03.001},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChengCXW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengLQS12,
author = {Eddie Cheng and
L{\'{a}}szl{\'{o}} Lipt{\'{a}}k and
Ke Qiu and
Zhizhang Shen},
title = {On deriving conditional diagnosability of interconnection networks},
journal = {Inf. Process. Lett.},
volume = {112},
number = {17-18},
pages = {674--677},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.008},
doi = {10.1016/J.IPL.2012.06.008},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChengLQS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Choi12,
author = {Jin{-}Ghoo Choi},
title = {Analysis of total average queue length in multi-hop wireless networks},
journal = {Inf. Process. Lett.},
volume = {112},
number = {3},
pages = {90--94},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.009},
doi = {10.1016/J.IPL.2011.10.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Choi12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChoiW12,
author = {Seung Geol Choi and
Hoeteck Wee},
title = {Lossy trapdoor functions from homomorphic reproducible encryption},
journal = {Inf. Process. Lett.},
volume = {112},
number = {20},
pages = {794--798},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.012},
doi = {10.1016/J.IPL.2012.07.012},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChoiW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChristouCFIJMP12,
author = {Michalis Christou and
Maxime Crochemore and
Tom{\'{a}}s Flouri and
Costas S. Iliopoulos and
Jan Janousek and
Borivoj Melichar and
Solon P. Pissis},
title = {Computing all subtree repeats in ordered trees},
journal = {Inf. Process. Lett.},
volume = {112},
number = {24},
pages = {958--962},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.09.001},
doi = {10.1016/J.IPL.2012.09.001},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChristouCFIJMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CiZZWY12,
author = {Yi{-}Wei Ci and
Zhan Zhang and
De{-}Cheng Zuo and
Zhibo Wu and
Xiao{-}Zong Yang},
title = {A multi-cycle checkpointing protocol that ensures strict 1-rollback},
journal = {Inf. Process. Lett.},
volume = {112},
number = {20},
pages = {788--793},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.008},
doi = {10.1016/J.IPL.2012.07.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CiZZWY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ClarkH12,
author = {David Clark and
Robert M. Hierons},
title = {Squeeziness: An information theoretic measure for avoiding fault masking},
journal = {Inf. Process. Lett.},
volume = {112},
number = {8-9},
pages = {335--340},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.004},
doi = {10.1016/J.IPL.2012.01.004},
timestamp = {Wed, 28 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ClarkH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CouturierK12,
author = {Jean{-}Fran{\c{c}}ois Couturier and
Dieter Kratsch},
title = {Bicolored independent sets and bicliques},
journal = {Inf. Process. Lett.},
volume = {112},
number = {8-9},
pages = {329--334},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.010},
doi = {10.1016/J.IPL.2012.01.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CouturierK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CroceK12,
author = {Federico Della Croce and
Christos Koulamas},
title = {A note on minimizing the sum of quadratic completion times on two
identical parallel machines},
journal = {Inf. Process. Lett.},
volume = {112},
number = {19},
pages = {738--742},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.011},
doi = {10.1016/J.IPL.2012.06.011},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CroceK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CrowstonGJY12,
author = {Robert Crowston and
Gregory Z. Gutin and
Mark Jones and
Anders Yeo},
title = {Parameterized Eulerian strong component arc deletion problem on tournaments},
journal = {Inf. Process. Lett.},
volume = {112},
number = {6},
pages = {249--251},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.014},
doi = {10.1016/J.IPL.2011.11.014},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CrowstonGJY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Csirmaz12,
author = {L{\'{a}}szl{\'{o}} Csirmaz},
title = {Complexity of universal access structures},
journal = {Inf. Process. Lett.},
volume = {112},
number = {4},
pages = {149--152},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.022},
doi = {10.1016/J.IPL.2011.10.022},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Csirmaz12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DankelmannEGMS12,
author = {Peter Dankelmann and
David Erwin and
Wayne Goddard and
Simon Mukwembi and
Henda C. Swart},
title = {Eccentric counts, connectivity and chordality},
journal = {Inf. Process. Lett.},
volume = {112},
number = {24},
pages = {944--947},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.022},
doi = {10.1016/J.IPL.2012.08.022},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DankelmannEGMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasA12,
author = {Angsuman Das and
Avishek Adhikari},
title = {An efficient {IND-CCA2} secure Paillier-based cryptosystem},
journal = {Inf. Process. Lett.},
volume = {112},
number = {22},
pages = {885--888},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.007},
doi = {10.1016/J.IPL.2012.08.007},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DasA12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DengZ12,
author = {Yun{-}Ping Deng and
Xiao{-}Dong Zhang},
title = {Automorphism groups of the Pancake graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {7},
pages = {264--266},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.010},
doi = {10.1016/J.IPL.2011.12.010},
timestamp = {Wed, 27 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DengZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Deorowicz12,
author = {Sebastian Deorowicz},
title = {Quadratic-time algorithm for a string constrained {LCS} problem},
journal = {Inf. Process. Lett.},
volume = {112},
number = {11},
pages = {423--426},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.007},
doi = {10.1016/J.IPL.2012.02.007},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Deorowicz12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DidimoKLOS12,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Yoshio Okamoto and
Andreas Spillner},
title = {Vertex angle and crossing angle resolution of leveled tree drawings},
journal = {Inf. Process. Lett.},
volume = {112},
number = {16},
pages = {630--635},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.006},
doi = {10.1016/J.IPL.2012.05.006},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DidimoKLOS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DietrichMS12,
author = {Max Dietrich and
Catherine McCartin and
Charles Semple},
title = {Bounding the maximum size of a minimal definitive set of quartets},
journal = {Inf. Process. Lett.},
volume = {112},
number = {16},
pages = {651--655},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.001},
doi = {10.1016/J.IPL.2012.06.001},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DietrichMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DieudonneP12,
author = {Yoann Dieudonn{\'{e}} and
Andrzej Pelc},
title = {Deterministic network exploration by a single agent with Byzantine
tokens},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {467--470},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.017},
doi = {10.1016/J.IPL.2012.03.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DieudonneP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DiochnosST12,
author = {Dimitrios I. Diochnos and
Robert H. Sloan and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {On multiple-instance learning of halfspaces},
journal = {Inf. Process. Lett.},
volume = {112},
number = {23},
pages = {933--936},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.017},
doi = {10.1016/J.IPL.2012.08.017},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DiochnosST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DoerrW12,
author = {Benjamin Doerr and
Carola Winzen},
title = {Memory-restricted black-box complexity of OneMax},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {32--34},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.004},
doi = {10.1016/J.IPL.2011.10.004},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DoerrW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DongZFY12,
author = {Qiang Dong and
Junlin Zhou and
Yan Fu and
Xiaofan Yang},
title = {Embedding a mesh of trees in the crossed cube},
journal = {Inf. Process. Lett.},
volume = {112},
number = {14-15},
pages = {599--603},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.013},
doi = {10.1016/J.IPL.2012.04.013},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DongZFY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DorrigivL12,
author = {Reza Dorrigiv and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {List update with probabilistic locality of reference},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {540--543},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.002},
doi = {10.1016/J.IPL.2012.04.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DorrigivL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DouradoRSS12,
author = {Mitre Costa Dourado and
Dieter Rautenbach and
Vin{\'{\i}}cius Fernandes dos Santos and
Jayme Luiz Szwarcfiter},
title = {Characterization and recognition of Radon-independent sets in split
graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {24},
pages = {948--952},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.013},
doi = {10.1016/J.IPL.2012.08.013},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DouradoRSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuCH12,
author = {Xiaoni Du and
Zhixiong Chen and
Lei Hu},
title = {Linear complexity of binary sequences derived from Euler quotients
with prime-power modulus},
journal = {Inf. Process. Lett.},
volume = {112},
number = {14-15},
pages = {604--609},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.011},
doi = {10.1016/J.IPL.2012.04.011},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DuCH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuKC12,
author = {Xiaoni Du and
Andrew Klapper and
Zhixiong Chen},
title = {Linear complexity of pseudorandom sequences generated by Fermat quotients
and their generalizations},
journal = {Inf. Process. Lett.},
volume = {112},
number = {6},
pages = {233--237},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.017},
doi = {10.1016/J.IPL.2011.11.017},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DuKC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DubslaffBB12,
author = {Clemens Dubslaff and
Christel Baier and
Manuela Berg},
title = {Model checking probabilistic systems against pushdown specifications},
journal = {Inf. Process. Lett.},
volume = {112},
number = {8-9},
pages = {320--328},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.006},
doi = {10.1016/J.IPL.2012.01.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DubslaffBB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Duris12,
author = {David Duris},
title = {Some characterizations of {\(\gamma\)} and {\(\beta\)}-acyclicity
of hypergraphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {16},
pages = {617--620},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.005},
doi = {10.1016/J.IPL.2012.05.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Duris12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DybizbanskiN12,
author = {Janusz Dybizbanski and
Anna Nenca},
title = {Oriented chromatic number of grids is greater than 7},
journal = {Inf. Process. Lett.},
volume = {112},
number = {4},
pages = {113--117},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.019},
doi = {10.1016/J.IPL.2011.10.019},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DybizbanskiN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EhsaniGKMN12,
author = {Shayan Ehsani and
Mohammad Ghodsi and
Ahmad Khajenezhad and
Hamid Mahini and
Afshin Nikzad},
title = {Optimal online pricing with network externalities},
journal = {Inf. Process. Lett.},
volume = {112},
number = {4},
pages = {118--123},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.004},
doi = {10.1016/J.IPL.2011.11.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EhsaniGKMN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Elmasry12,
author = {Amr Elmasry},
title = {On the size of the subset partial order},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {487--489},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.005},
doi = {10.1016/J.IPL.2012.03.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Elmasry12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FarhanaR12,
author = {Effat Farhana and
M. Sohel Rahman},
title = {Doubly-Constrained {LCS} and Hybrid-Constrained {LCS} problems revisited},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {562--565},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.007},
doi = {10.1016/J.IPL.2012.04.007},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FarhanaR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FarrasGMP12,
author = {Oriol Farr{\`{a}}s and
Ignacio Gracia and
Sebasti{\`{a}} Mart{\'{\i}}n Mollev{\'{\i}} and
Carles Padr{\'{o}}},
title = {Linear threshold multisecret sharing schemes},
journal = {Inf. Process. Lett.},
volume = {112},
number = {17-18},
pages = {667--673},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.008},
doi = {10.1016/J.IPL.2012.05.008},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FarrasGMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FengL12,
author = {Yun Feng and
Wensong Lin},
title = {A proof of a conjecture on multiset coloring the powers of cycles},
journal = {Inf. Process. Lett.},
volume = {112},
number = {17-18},
pages = {678--682},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.004},
doi = {10.1016/J.IPL.2012.06.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FengL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FiedorowiczH12,
author = {Anna Fiedorowicz and
Mariusz Haluszczak},
title = {Acyclic chromatic indices of fully subdivided graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {557--561},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.004},
doi = {10.1016/J.IPL.2012.04.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FiedorowiczH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FujiwaraS12,
author = {Hiroshi Fujiwara and
Yoshiyuki Sekiguchi},
title = {An improved analysis of {SRPT} scheduling algorithm on the basis of
functional optimization},
journal = {Inf. Process. Lett.},
volume = {112},
number = {23},
pages = {911--915},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.009},
doi = {10.1016/J.IPL.2012.08.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FujiwaraS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FungPY12,
author = {Stanley P. Y. Fung and
Chung Keung Poon and
Duncan K. W. Yung},
title = {On-line scheduling of equal-length intervals on parallel machines},
journal = {Inf. Process. Lett.},
volume = {112},
number = {10},
pages = {376--379},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.015},
doi = {10.1016/J.IPL.2012.01.015},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FungPY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GafarovLW12,
author = {Evgeny R. Gafarov and
Alexander A. Lazarev and
Frank Werner},
title = {A note on a single machine scheduling problem with generalized total
tardiness objective function},
journal = {Inf. Process. Lett.},
volume = {112},
number = {3},
pages = {72--76},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.013},
doi = {10.1016/J.IPL.2011.10.013},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GafarovLW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GarderenLM12,
author = {Mereke van Garderen and
Giuseppe Liotta and
Henk Meijer},
title = {Universal point sets for 2-coloured trees},
journal = {Inf. Process. Lett.},
volume = {112},
number = {8-9},
pages = {346--350},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.009},
doi = {10.1016/J.IPL.2012.01.009},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GarderenLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GastinS12,
author = {Paul Gastin and
Nathalie Sznajder},
title = {Decidability of well-connectedness for distributed synthesis},
journal = {Inf. Process. Lett.},
volume = {112},
number = {24},
pages = {963--968},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.018},
doi = {10.1016/J.IPL.2012.08.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GastinS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gerbessiotis12,
author = {Alexandros V. Gerbessiotis},
title = {An improved reliability bound of a probabilistic parallel integer
sorting algorithm},
journal = {Inf. Process. Lett.},
volume = {112},
number = {24},
pages = {976--979},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.09.003},
doi = {10.1016/J.IPL.2012.09.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gerbessiotis12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GerstlM12,
author = {Enrique Gerstl and
Gur Mosheiov},
title = {Scheduling on parallel identical machines with job-rejection and position-dependent
processing times},
journal = {Inf. Process. Lett.},
volume = {112},
number = {19},
pages = {743--747},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.009},
doi = {10.1016/J.IPL.2012.06.009},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GerstlM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoldbergE12,
author = {Noam Goldberg and
Jonathan Eckstein},
title = {Sparse weighted voting classifier selection and its linear programming
relaxations},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {481--486},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.004},
doi = {10.1016/J.IPL.2012.03.004},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoldbergE12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoldreichM12,
author = {Oded Goldreich and
Or Meir},
title = {The tensor product of two good codes is not necessarily robustly testable},
journal = {Inf. Process. Lett.},
volume = {112},
number = {8-9},
pages = {351--355},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.007},
doi = {10.1016/J.IPL.2012.01.007},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GoldreichM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GolynskiL12,
author = {Alexander Golynski and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {Optimal strategies for the list update problem under the {MRM} alternative
cost model},
journal = {Inf. Process. Lett.},
volume = {112},
number = {6},
pages = {218--222},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.001},
doi = {10.1016/J.IPL.2011.12.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GolynskiL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gueron12,
author = {Shay Gueron},
title = {Speeding up {CRC32C} computations with Intel {CRC32} instruction},
journal = {Inf. Process. Lett.},
volume = {112},
number = {5},
pages = {179--185},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.015},
doi = {10.1016/J.IPL.2011.11.015},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gueron12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoLLX12,
author = {Qiaoping Guo and
Shengjia Li and
Ruijuan Li and
Gaokui Xu},
title = {Pancyclic out-arcs of a vertex in oriented graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {20},
pages = {759--761},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.001},
doi = {10.1016/J.IPL.2012.07.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuoLLX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoZJYCYL12,
author = {Deke Guo and
Guiming Zhu and
Hai Jin and
Panlong Yang and
Yingwen Chen and
Xianqing Yi and
Junxian Liu},
title = {M{\"{o}}bius-deBruijn: The product of M{\"{o}}bius cube
and deBruijn digraph},
journal = {Inf. Process. Lett.},
volume = {112},
number = {5},
pages = {205--211},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.023},
doi = {10.1016/J.IPL.2011.10.023},
timestamp = {Fri, 03 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuoZJYCYL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Guttmann-BeckH12,
author = {Nili Guttmann{-}Beck and
Refael Hassin},
title = {Series-parallel orientations preserving the cycle-radius},
journal = {Inf. Process. Lett.},
volume = {112},
number = {4},
pages = {153--160},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.020},
doi = {10.1016/J.IPL.2011.10.020},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Guttmann-BeckH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HeL12,
author = {Jing He and
Hongyu Liang},
title = {On rainbow-k-connectivity of random graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {10},
pages = {406--410},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.014},
doi = {10.1016/J.IPL.2012.01.014},
timestamp = {Mon, 15 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HeL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HedetniemiHJKM12,
author = {Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Hao Jiang and
Ken Kennedy and
Alice A. McRae},
title = {A self-stabilizing algorithm for optimally efficient sets in graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {16},
pages = {621--623},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.014},
doi = {10.1016/J.IPL.2012.02.014},
timestamp = {Tue, 25 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HedetniemiHJKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HirschI12,
author = {Edward A. Hirsch and
Dmitry Itsykson},
title = {On an optimal randomized acceptor for graph nonisomorphism},
journal = {Inf. Process. Lett.},
volume = {112},
number = {5},
pages = {166--171},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.013},
doi = {10.1016/J.IPL.2011.11.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HirschI12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoustonWA12,
author = {Robin Houston and
Joseph White and
Martyn Amos},
title = {Zen Puzzle Garden is NP-complete},
journal = {Inf. Process. Lett.},
volume = {112},
number = {3},
pages = {106--108},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.016},
doi = {10.1016/J.IPL.2011.10.016},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HoustonWA12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hrubes12,
author = {Pavel Hrubes},
title = {On the nonnegative rank of distance matrices},
journal = {Inf. Process. Lett.},
volume = {112},
number = {11},
pages = {457--461},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.009},
doi = {10.1016/J.IPL.2012.02.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hrubes12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HwangKK12,
author = {Jinsoo Hwang and
Jeankyung Kim and
Kichang Kim},
title = {Analysis of the false-positive error rate of tagged fragment marking
scheme},
journal = {Inf. Process. Lett.},
volume = {112},
number = {6},
pages = {227--232},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.006},
doi = {10.1016/J.IPL.2011.12.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HwangKK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HwangYC12,
author = {Iksoon Hwang and
Nina Yevtushenko and
Ana R. Cavalli},
title = {Tight bound on the length of distinguishing sequences for non-observable
nondeterministic Finite-State Machines with a polynomial number of
inputs and outputs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {7},
pages = {298--301},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.012},
doi = {10.1016/J.IPL.2011.12.012},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HwangYC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IsaakL12,
author = {Dimitri Isaak and
Christof L{\"{o}}ding},
title = {Efficient inclusion testing for simple classes of unambiguous {\(\omega\)}-automata},
journal = {Inf. Process. Lett.},
volume = {112},
number = {14-15},
pages = {578--582},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.010},
doi = {10.1016/J.IPL.2012.04.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IsaakL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IwerksM12,
author = {Justin Iwerks and
Joseph S. B. Mitchell},
title = {The art gallery theorem for simple polygons in terms of the number
of reflex and convex vertices},
journal = {Inf. Process. Lett.},
volume = {112},
number = {20},
pages = {778--782},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.005},
doi = {10.1016/J.IPL.2012.07.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IwerksM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IzsakN12,
author = {Rani Izsak and
Zeev Nutov},
title = {A note on labeling schemes for graph connectivity},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {39--43},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.001},
doi = {10.1016/J.IPL.2011.10.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IzsakN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JamisonN12,
author = {Robert E. Jamison and
Darren A. Narayan},
title = {Max-optimal and sum-optimal labelings of graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {26--31},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.09.006},
doi = {10.1016/J.IPL.2011.09.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JamisonN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jansen12,
author = {Maurice Jansen},
title = {Towards a tight hardness-randomness connection between permanent and
arithmetic circuit identity testing},
journal = {Inf. Process. Lett.},
volume = {112},
number = {24},
pages = {969--975},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.001},
doi = {10.1016/J.IPL.2012.08.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jansen12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Januszewski12,
author = {Janusz Januszewski},
title = {On-line algorithms for 2-space bounded 2-dimensional bin packing},
journal = {Inf. Process. Lett.},
volume = {112},
number = {19},
pages = {719--722},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.016},
doi = {10.1016/J.IPL.2012.06.016},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Januszewski12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jordan12,
author = {Tibor Jord{\'{a}}n},
title = {Highly connected molecular graphs are rigid in three dimensions},
journal = {Inf. Process. Lett.},
volume = {112},
number = {8-9},
pages = {356--359},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.013},
doi = {10.1016/J.IPL.2012.01.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jordan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jukna12,
author = {Stasys Jukna},
title = {Clique problem, cutting plane proofs and communication complexity},
journal = {Inf. Process. Lett.},
volume = {112},
number = {20},
pages = {772--777},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.003},
doi = {10.1016/J.IPL.2012.07.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jukna12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kalinich12,
author = {Adam O. Kalinich},
title = {Flipping the winner of a poset game},
journal = {Inf. Process. Lett.},
volume = {112},
number = {3},
pages = {86--89},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.09.016},
doi = {10.1016/J.IPL.2011.09.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kalinich12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KeZ12,
author = {Pinhui Ke and
Shengyuan Zhang},
title = {New classes of quaternary cyclotomic sequence of length 2p\({}^{\mbox{m}}\)
with high linear complexity},
journal = {Inf. Process. Lett.},
volume = {112},
number = {16},
pages = {646--650},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.011},
doi = {10.1016/J.IPL.2012.05.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KeZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kochol12,
author = {Martin Kochol},
title = {Non-extendible latin parallelepipeds},
journal = {Inf. Process. Lett.},
volume = {112},
number = {24},
pages = {942--943},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.014},
doi = {10.1016/J.IPL.2012.08.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kochol12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KocholS12,
author = {Martin Kochol and
Riste Skrekovski},
title = {Brooks' Theorem for generalized dart graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {5},
pages = {200--204},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.010},
doi = {10.1016/J.IPL.2011.11.010},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KocholS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KolaitisP12,
author = {Phokion G. Kolaitis and
Enela Pema},
title = {A dichotomy in the complexity of consistent query answering for queries
with two atoms},
journal = {Inf. Process. Lett.},
volume = {112},
number = {3},
pages = {77--85},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.018},
doi = {10.1016/J.IPL.2011.10.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KolaitisP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Korman12,
author = {Matias Korman},
title = {Minimizing interference in ad hoc networks with bounded communication
radius},
journal = {Inf. Process. Lett.},
volume = {112},
number = {19},
pages = {748--752},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.021},
doi = {10.1016/J.IPL.2012.06.021},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Korman12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kotrbcik12,
author = {Michal Kotrbc{\'{\i}}k},
title = {A note on disjoint cycles},
journal = {Inf. Process. Lett.},
volume = {112},
number = {4},
pages = {135--137},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.006},
doi = {10.1016/J.IPL.2011.11.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kotrbcik12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Koutis12,
author = {Ioannis Koutis},
title = {Constrained multilinear detection for faster functional motif discovery},
journal = {Inf. Process. Lett.},
volume = {112},
number = {22},
pages = {889--892},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.008},
doi = {10.1016/J.IPL.2012.08.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Koutis12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Krajicek12,
author = {Jan Kraj{\'{\i}}cek},
title = {A note on {SAT} algorithms and proof complexity},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {490--493},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.009},
doi = {10.1016/J.IPL.2012.03.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Krajicek12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KrumkeT12,
author = {Sven Oliver Krumke and
Clemens Thielen},
title = {Erratum to "Minimum cost flows with minimum quantities" [Information
Processing Letters 111 {(11)} {(2011)} 533-537]},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {523--524},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.016},
doi = {10.1016/J.IPL.2012.03.016},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KrumkeT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KumamotoM12,
author = {Masao Kumamoto and
Eiji Miyano},
title = {Optimal distortion embedding of complete binary trees into lines},
journal = {Inf. Process. Lett.},
volume = {112},
number = {10},
pages = {365--370},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.003},
doi = {10.1016/J.IPL.2012.02.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KumamotoM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KuoY12,
author = {Wen{-}Hung Kuo and
Dar{-}Li Yang},
title = {A short note on "Proportionate flowshops with general position-dependent
processing times"},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {479--480},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.013},
doi = {10.1016/J.IPL.2012.02.013},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KuoY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kutzkov12,
author = {Konstantin Kutzkov},
title = {An exact exponential time algorithm for counting bipartite cliques},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {535--539},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.001},
doi = {10.1016/J.IPL.2012.04.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kutzkov12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaiXLY12,
author = {Hong Lai and
Jinghua Xiao and
Lixiang Li and
Yixian Yang},
title = {Recursive hiding of biometrics-based secret sharing scheme using adversary
structure},
journal = {Inf. Process. Lett.},
volume = {112},
number = {17-18},
pages = {683--687},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.006},
doi = {10.1016/J.IPL.2012.06.006},
timestamp = {Sat, 13 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LaiXLY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeKCCP12,
author = {Jaeheung Lee and
Seokhyun Kim and
Yookun Cho and
Yoojin Chung and
Yongsu Park},
title = {{HORSIC:} An efficient one-time signature scheme for wireless sensor
networks},
journal = {Inf. Process. Lett.},
volume = {112},
number = {20},
pages = {783--787},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.007},
doi = {10.1016/J.IPL.2012.07.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeKCCP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Li12,
author = {Jiyou Li},
title = {On the average sensitivity of the weighted sum function},
journal = {Inf. Process. Lett.},
volume = {112},
number = {4},
pages = {143--148},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.001},
doi = {10.1016/J.IPL.2011.11.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Li12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiXDX12,
author = {Yu Li and
Dachuan Xu and
Donglei Du and
Naihua Xiu},
title = {Improved approximation algorithms for the robust fault-tolerant facility
location problem},
journal = {Inf. Process. Lett.},
volume = {112},
number = {10},
pages = {361--364},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.004},
doi = {10.1016/J.IPL.2012.02.004},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiXDX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiZLY12,
author = {Wenjie Li and
Zhenkun Zhang and
Hailing Liu and
Jinjiang Yuan},
title = {Online scheduling of equal-length jobs with incompatible families
on multiple batch machines to maximize the weighted number of early
jobs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {503--508},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.015},
doi = {10.1016/J.IPL.2012.03.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiZLY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiZY12,
author = {Wenhua Li and
Zhenkun Zhang and
Sufang Yang},
title = {Online algorithms for scheduling unit length jobs on parallel-batch
machines with lookahead},
journal = {Inf. Process. Lett.},
volume = {112},
number = {7},
pages = {292--297},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.002},
doi = {10.1016/J.IPL.2012.01.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiZY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lin12,
author = {Jyhjong Lin},
title = {Enhancing customer relationships by semantic consumer support systems},
journal = {Inf. Process. Lett.},
volume = {112},
number = {22},
pages = {860--868},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.002},
doi = {10.1016/J.IPL.2012.08.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lin12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinZ12,
author = {Qiping Lin and
Fangguo Zhang},
title = {Efficient precomputation schemes of kP+IQ},
journal = {Inf. Process. Lett.},
volume = {112},
number = {11},
pages = {462--466},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.010},
doi = {10.1016/J.IPL.2012.03.010},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LinZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuZCX12,
author = {Ming Liu and
Feifeng Zheng and
Chengbin Chu and
Yinfeng Xu},
title = {Single-machine scheduling with past-sequence-dependent delivery times
and release times},
journal = {Inf. Process. Lett.},
volume = {112},
number = {21},
pages = {835--838},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.002},
doi = {10.1016/J.IPL.2012.07.002},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuZCX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaWZ12,
author = {Beibei Ma and
Baoyindureng Wu and
Wanping Zhang},
title = {Proximity and average eccentricity of a graph},
journal = {Inf. Process. Lett.},
volume = {112},
number = {10},
pages = {392--395},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.001},
doi = {10.1016/J.IPL.2012.02.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MaWZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MalekesmaeiliCS12,
author = {Mehrnoush Malekesmaeili and
C{\'{e}}dric Chauve and
Tamon Stephen},
title = {A tight bound on the length of odd cycles in the incompatibility graph
of a non-C1P matrix},
journal = {Inf. Process. Lett.},
volume = {112},
number = {20},
pages = {799--803},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.004},
doi = {10.1016/J.IPL.2012.07.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MalekesmaeiliCS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MathewS12,
author = {Sunil Mathew and
M. S. Sunitha},
title = {A characterization of partial blocks in weighted graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {17-18},
pages = {706--710},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.015},
doi = {10.1016/J.IPL.2012.06.015},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MathewS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MathieuO12,
author = {Claire Mathieu and
Olga Ohrimenko},
title = {Lower bounds for randomized algorithms for online chain partitioning},
journal = {Inf. Process. Lett.},
volume = {112},
number = {17-18},
pages = {663--666},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.010},
doi = {10.1016/J.IPL.2012.05.010},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MathieuO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Matsuki12,
author = {Norichika Matsuki},
title = {An analytic criterion for {CSAT}},
journal = {Inf. Process. Lett.},
volume = {112},
number = {5},
pages = {164--165},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.011},
doi = {10.1016/J.IPL.2011.11.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Matsuki12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Meir12,
author = {Or Meir},
title = {On the rectangle method in proofs of robustness of tensor products},
journal = {Inf. Process. Lett.},
volume = {112},
number = {6},
pages = {257--260},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.007},
doi = {10.1016/J.IPL.2011.11.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Meir12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mennink12,
author = {Bart Mennink},
title = {Increasing the flexibility of the herding attack},
journal = {Inf. Process. Lett.},
volume = {112},
number = {3},
pages = {98--105},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.014},
doi = {10.1016/J.IPL.2011.10.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mennink12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MeshramMZ12,
author = {Chandrashekhar Meshram and
Suchitra A. Meshram and
Mingwu Zhang},
title = {An ID-based cryptographic mechanisms based on {GDLP} and {IFP}},
journal = {Inf. Process. Lett.},
volume = {112},
number = {19},
pages = {753--758},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.018},
doi = {10.1016/J.IPL.2012.06.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MeshramMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MihaljevicGPI12,
author = {Miodrag J. Mihaljevic and
Sugata Gangopadhyay and
Goutam Paul and
Hideki Imai},
title = {Internal state recovery of keystream generator {LILI-128} based on
a novel weakness of the employed Boolean function},
journal = {Inf. Process. Lett.},
volume = {112},
number = {21},
pages = {805--810},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.013},
doi = {10.1016/J.IPL.2012.07.013},
timestamp = {Sun, 17 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MihaljevicGPI12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MinierN12,
author = {Marine Minier and
Mar{\'{\i}}a Naya{-}Plasencia},
title = {A related key impossible differential attack against 22 rounds of
the lightweight block cipher LBlock},
journal = {Inf. Process. Lett.},
volume = {112},
number = {16},
pages = {624--629},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.012},
doi = {10.1016/J.IPL.2012.04.012},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MinierN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MollTT12,
author = {Lukas Moll and
Siamak Tazari and
Marc Thurley},
title = {Computing hypergraph width measures exactly},
journal = {Inf. Process. Lett.},
volume = {112},
number = {6},
pages = {238--242},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.002},
doi = {10.1016/J.IPL.2011.12.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MollTT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Montanaro12,
author = {Ashley Montanaro},
title = {The quantum query complexity of learning multilinear polynomials},
journal = {Inf. Process. Lett.},
volume = {112},
number = {11},
pages = {438--442},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.002},
doi = {10.1016/J.IPL.2012.03.002},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Montanaro12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MorM12,
author = {Baruch Mor and
Gur Mosheiov},
title = {Batch scheduling of identical jobs on parallel identical machines},
journal = {Inf. Process. Lett.},
volume = {112},
number = {20},
pages = {762--766},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.020},
doi = {10.1016/J.IPL.2012.06.020},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MorM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NakadeB12,
author = {Apurv Nakade and
Somenath Biswas},
title = {Effect of increasing the energy gap between the two lowest energy
states on the mixing time of the Metropolis algorithm},
journal = {Inf. Process. Lett.},
volume = {112},
number = {23},
pages = {922--927},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.012},
doi = {10.1016/J.IPL.2012.08.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NakadeB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OlsenBT12,
author = {Martin Olsen and
Lars B{\ae}kgaard and
Torben Tambo},
title = {On non-trivial Nash stable partitions in additive hedonic games with
symmetric 0/1-utilities},
journal = {Inf. Process. Lett.},
volume = {112},
number = {23},
pages = {903--907},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.016},
doi = {10.1016/J.IPL.2012.08.016},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OlsenBT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PaghT12,
author = {Rasmus Pagh and
Charalampos E. Tsourakakis},
title = {Colorful triangle counting and a MapReduce implementation},
journal = {Inf. Process. Lett.},
volume = {112},
number = {7},
pages = {277--281},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.007},
doi = {10.1016/J.IPL.2011.12.007},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PaghT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PandaG12,
author = {B. S. Panda and
Preeti Goel},
title = {L(2,1)-labeling of dually chordal graphs and strongly orderable graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {552--556},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.003},
doi = {10.1016/J.IPL.2012.04.003},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PandaG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PasalicZ12,
author = {Enes Pasalic and
Wei{-}Guo Zhang},
title = {On multiple output bent functions},
journal = {Inf. Process. Lett.},
volume = {112},
number = {21},
pages = {811--815},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.009},
doi = {10.1016/J.IPL.2012.07.009},
timestamp = {Wed, 11 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PasalicZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pettie12,
author = {Seth Pettie},
title = {A simple reduction from maximum weight matching to maximum cardinality
matching},
journal = {Inf. Process. Lett.},
volume = {112},
number = {23},
pages = {893--898},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.010},
doi = {10.1016/J.IPL.2012.08.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pettie12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Picard12,
author = {Willy Picard},
title = {Membership(s) and compliance(s) with class-based graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {22},
pages = {849--855},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.005},
doi = {10.1016/J.IPL.2012.08.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Picard12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Podolskii12,
author = {Vladimir V. Podolskii},
title = {Exponential lower bound for bounded depth circuits with few threshold
gates},
journal = {Inf. Process. Lett.},
volume = {112},
number = {7},
pages = {267--271},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.011},
doi = {10.1016/J.IPL.2011.12.011},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Podolskii12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pradhan12,
author = {Dinabandhu Pradhan},
title = {Algorithmic aspects of k-tuple total domination in graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {21},
pages = {816--822},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.010},
doi = {10.1016/J.IPL.2012.07.010},
timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Pradhan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pudlak12,
author = {Pavel Pudl{\'{a}}k},
title = {A lower bound on the size of resolution proofs of the Ramsey theorem},
journal = {Inf. Process. Lett.},
volume = {112},
number = {14-15},
pages = {610--611},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.004},
doi = {10.1016/J.IPL.2012.05.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pudlak12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RajasinghARM12,
author = {Indra Rajasingh and
Micheal Arockiaraj and
Bharati Rajan and
Paul D. Manuel},
title = {Minimum wirelength of hypercubes into n-dimensional grid networks},
journal = {Inf. Process. Lett.},
volume = {112},
number = {14-15},
pages = {583--586},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.008},
doi = {10.1016/J.IPL.2012.04.008},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RajasinghARM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RajasinghRR12,
author = {Indra Rajasingh and
Bharati Rajan and
R. Sundara Rajan},
title = {Embedding of hypercubes into necklace, windmill and snake graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {509--515},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.006},
doi = {10.1016/J.IPL.2012.03.006},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RajasinghRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReidenbachS12,
author = {Daniel Reidenbach and
Markus L. Schmid},
title = {On multi-head automata with restricted nondeterminism},
journal = {Inf. Process. Lett.},
volume = {112},
number = {14-15},
pages = {572--577},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.009},
doi = {10.1016/J.IPL.2012.04.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ReidenbachS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RuedaS12,
author = {Sonia L. Rueda and
Juana Sendra},
title = {On the performance of the approximate parametrization algorithm for
curves},
journal = {Inf. Process. Lett.},
volume = {112},
number = {5},
pages = {172--178},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.008},
doi = {10.1016/J.IPL.2011.11.008},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RuedaS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Salmela12,
author = {Leena Salmela},
title = {Average complexity of backward q-gram string matching algorithms},
journal = {Inf. Process. Lett.},
volume = {112},
number = {11},
pages = {433--437},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.010},
doi = {10.1016/J.IPL.2012.02.010},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Salmela12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SchaudtS12,
author = {Oliver Schaudt and
Rainer Schrader},
title = {The complexity of connected dominating sets and total dominating sets
with specified induced subgraphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {24},
pages = {953--957},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.09.002},
doi = {10.1016/J.IPL.2012.09.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SchaudtS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schmidt-SchaussS12,
author = {Manfred Schmidt{-}Schau{\ss} and
Georg Schnitger},
title = {Fast equality test for straight-line compressed strings},
journal = {Inf. Process. Lett.},
volume = {112},
number = {8-9},
pages = {341--345},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.008},
doi = {10.1016/J.IPL.2012.01.008},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Schmidt-SchaussS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SergeyC12,
author = {Ilya Sergey and
Dave Clarke},
title = {A correspondence between type checking via reduction and type checking
via evaluation},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {13--20},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.008},
doi = {10.1016/J.IPL.2011.10.008},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SergeyC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shi12,
author = {Zhengnan Shi},
title = {A self-stabilizing algorithm to maximal 2-packing with improved complexity},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {525--531},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.018},
doi = {10.1016/J.IPL.2012.03.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shi12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShiehTY12,
author = {Min{-}Zheng Shieh and
Shi{-}Chun Tsai and
Ming{-}Chuan Yang},
title = {On the inapproximability of maximum intersection problems},
journal = {Inf. Process. Lett.},
volume = {112},
number = {19},
pages = {723--727},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.014},
doi = {10.1016/J.IPL.2012.06.014},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShiehTY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShresthaTU12,
author = {Anish Man Singh Shrestha and
Satoshi Tayu and
Shuichi Ueno},
title = {Bandwidth of convex bipartite graphs and related graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {11},
pages = {411--417},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.012},
doi = {10.1016/J.IPL.2012.02.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShresthaTU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Skowronek-Kaziow12,
author = {Joanna Skowronek{-}Kazi{\'{o}}w},
title = {Multiplicative vertex-colouring weightings of graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {5},
pages = {191--194},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.009},
doi = {10.1016/J.IPL.2011.11.009},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Skowronek-Kaziow12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sliva12,
author = {Radek Sl{\'{\i}}va},
title = {Antimagic labeling graphs with a regular dominating subgraph},
journal = {Inf. Process. Lett.},
volume = {112},
number = {21},
pages = {844--847},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.017},
doi = {10.1016/J.IPL.2012.07.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sliva12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SparlWZ12,
author = {Petra Sparl and
Rafal Witkowski and
Janez Zerovnik},
title = {A linear time algorithm for 7-[3]coloring triangle-free hexagonal
graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {14-15},
pages = {567--571},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.008},
doi = {10.1016/J.IPL.2012.02.008},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SparlWZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SrivathsanW12,
author = {B. Srivathsan and
Igor Walukiewicz},
title = {An alternate proof of Statman's finite completeness theorem},
journal = {Inf. Process. Lett.},
volume = {112},
number = {14-15},
pages = {612--616},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.014},
doi = {10.1016/J.IPL.2012.04.014},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SrivathsanW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SuF12,
author = {Chen Su and
Haining Fan},
title = {Impact of Intel's new instruction sets on software implementation
of GF(2)[x] multiplication},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {497--502},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.012},
doi = {10.1016/J.IPL.2012.03.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SuF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SuSK12,
author = {Hsun Su and
Yuan{-}Kang Shih and
Shin{-}Shin Kao},
title = {On the 1-fault hamiltonicity for graphs satisfying Ore's theorem},
journal = {Inf. Process. Lett.},
volume = {112},
number = {21},
pages = {839--843},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.014},
doi = {10.1016/J.IPL.2012.07.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SuSK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SunHL12,
author = {Da{-}Zhi Sun and
Jin{-}Peng Huai and
Jian{-}Xin Li},
title = {A note on asynchronous multi-exponentiation algorithm using binary
representation},
journal = {Inf. Process. Lett.},
volume = {112},
number = {22},
pages = {876--879},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.006},
doi = {10.1016/J.IPL.2012.08.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SunHL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sviridenko12,
author = {Maxim Sviridenko},
title = {A note on the Kenyon-Remila strip-packing algorithm},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {10--12},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.003},
doi = {10.1016/J.IPL.2011.10.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sviridenko12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Szymanska12,
author = {Edyta Szymanska},
title = {H-colorings of dense hypergraphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {23},
pages = {899--902},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.011},
doi = {10.1016/J.IPL.2012.08.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Szymanska12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TakeharaHS12,
author = {Reiko Takehara and
Masahiro Hachimori and
Maiko Shigeno},
title = {A comment on pure-strategy Nash equilibria in competitive diffusion
games},
journal = {Inf. Process. Lett.},
volume = {112},
number = {3},
pages = {59--60},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.015},
doi = {10.1016/J.IPL.2011.10.015},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TakeharaHS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Thomas12,
author = {Michael Thomas},
title = {On the applicability of Post's lattice},
journal = {Inf. Process. Lett.},
volume = {112},
number = {10},
pages = {386--391},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.002},
doi = {10.1016/J.IPL.2012.02.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Thomas12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TianL12,
author = {Fang Tian and
Zi{-}Long Liu},
title = {Probabilistic single obnoxious facility location with fixed budget},
journal = {Inf. Process. Lett.},
volume = {112},
number = {5},
pages = {195--199},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.09.001},
doi = {10.1016/J.IPL.2011.09.001},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TianL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Turetsky12,
author = {Daniel Turetsky},
title = {A K-trivial set which is not jump traceable at certain orders},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {544--547},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.005},
doi = {10.1016/J.IPL.2012.04.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Turetsky12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Valdeon12,
author = {Jos{\'{e}} Miguel Ca{\~{n}}ete Valde{\'{o}}n},
title = {Annotating problem diagrams with architectural tactics for reasoning
on quality requirements},
journal = {Inf. Process. Lett.},
volume = {112},
number = {16},
pages = {656--661},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.002},
doi = {10.1016/J.IPL.2012.06.002},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Valdeon12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Valmari12,
author = {Antti Valmari},
title = {Fast brief practical {DFA} minimization},
journal = {Inf. Process. Lett.},
volume = {112},
number = {6},
pages = {213--217},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.004},
doi = {10.1016/J.IPL.2011.12.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Valmari12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangB12,
author = {Qingju Wang and
Andrey Bogdanov},
title = {The provable constructive effect of diffusion switching mechanism
in CLEFIA-type block ciphers},
journal = {Inf. Process. Lett.},
volume = {112},
number = {11},
pages = {427--432},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.006},
doi = {10.1016/J.IPL.2012.02.006},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangBCDGHS12,
author = {Yuxin Wang and
Attila Benko and
Xin Chen and
Gy{\"{o}}rgy D{\'{o}}sa and
He Guo and
Xin Han and
Cecilia Sik{-}L{\'{a}}nyi},
title = {Online scheduling with one rearrangement at the end: Revisited},
journal = {Inf. Process. Lett.},
volume = {112},
number = {16},
pages = {641--645},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.009},
doi = {10.1016/J.IPL.2012.05.009},
timestamp = {Thu, 03 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangBCDGHS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangCZZ12,
author = {GuiPing Wang and
Shuyu Chen and
Xiaoqin Zhang and
Zhen Zhou},
title = {Topological ordering algorithm for {LDAG}},
journal = {Inf. Process. Lett.},
volume = {112},
number = {21},
pages = {823--828},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.015},
doi = {10.1016/J.IPL.2012.07.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangCZZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangL12,
author = {Feng Wang and
Wensong Lin},
title = {Group path covering and L(j, k)-labelings of diameter two graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {4},
pages = {124--128},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.005},
doi = {10.1016/J.IPL.2011.11.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangSW12,
author = {Hechao Wang and
Erfang Shan and
Wei Wang},
title = {On the super connectivity of Kronecker products of graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {10},
pages = {402--405},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.011},
doi = {10.1016/J.IPL.2012.01.011},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WangSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangT12,
author = {Qichun Wang and
Chik How Tan},
title = {A note on the algebraic immunity of the Maiorana-McFarland class of
bent functions},
journal = {Inf. Process. Lett.},
volume = {112},
number = {22},
pages = {869--871},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.004},
doi = {10.1016/J.IPL.2012.08.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangWS12,
author = {Gaocai Wang and
Guojun Wang and
Zhiguang Shan},
title = {Fault tolerance analysis of mesh networks with uniform versus nonuniform
node failure probability},
journal = {Inf. Process. Lett.},
volume = {112},
number = {10},
pages = {396--401},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.12.013},
doi = {10.1016/J.IPL.2011.12.013},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangWS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangXZGX12,
author = {Jian Wang and
Xirong Xu and
Dejun Zhu and
Liqing Gao and
Jun{-}Ming Xu},
title = {On the bounds of feedback numbers of (n, k)-star graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {473--478},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.014},
doi = {10.1016/J.IPL.2012.03.014},
timestamp = {Wed, 27 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WangXZGX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangZL12,
author = {Shiying Wang and
Lei Zhang and
Shangwei Lin},
title = {A neighborhood condition for graphs to be maximally k-restricted edge
connected},
journal = {Inf. Process. Lett.},
volume = {112},
number = {3},
pages = {95--97},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.012},
doi = {10.1016/J.IPL.2011.10.012},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangZL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Xavier12,
author = {Eduardo C. Xavier},
title = {A note on a Maximum k-Subset Intersection problem},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {471--472},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.007},
doi = {10.1016/J.IPL.2012.03.007},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Xavier12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XiaoN12,
author = {Mingyu Xiao and
Hiroshi Nagamochi},
title = {An {FPT} algorithm for edge subset feedback edge set},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {5--9},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.007},
doi = {10.1016/J.IPL.2011.10.007},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/XiaoN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XieTTH12,
author = {Y. Xie and
S. Tang and
C. Tang and
X. Huang},
title = {An efficient algorithm for parameterizing HsMM with Gaussian and Gamma
distributions},
journal = {Inf. Process. Lett.},
volume = {112},
number = {19},
pages = {732--737},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.005},
doi = {10.1016/J.IPL.2012.06.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XieTTH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XieW12,
author = {Min Xie and
Libin Wang},
title = {One-round identity-based key exchange with Perfect Forward Security},
journal = {Inf. Process. Lett.},
volume = {112},
number = {14-15},
pages = {587--591},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.001},
doi = {10.1016/J.IPL.2012.05.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XieW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Xu12,
author = {Ning Xu},
title = {Complexity of minimum corridor guarding problems},
journal = {Inf. Process. Lett.},
volume = {112},
number = {17-18},
pages = {691--696},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.003},
doi = {10.1016/J.IPL.2012.06.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Xu12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangWY12,
author = {Xiaofan Yang and
Lei Wang and
Luxing Yang},
title = {Optimal broadcasting for locally twisted cubes},
journal = {Inf. Process. Lett.},
volume = {112},
number = {4},
pages = {129--134},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.003},
doi = {10.1016/J.IPL.2011.11.003},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangWY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangZZX12,
author = {Xingyu Yang and
Weiguo Zhang and
Yong Zhang and
Weijun Xu},
title = {Optimal randomized algorithm for a generalized ski-rental with interest
rate},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {548--551},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.04.006},
doi = {10.1016/J.IPL.2012.04.006},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangZZX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YoshinakaKDAM12,
author = {Ryo Yoshinaka and
Jun Kawahara and
Shuhei Denzumi and
Hiroki Arimura and
Shin{-}ichi Minato},
title = {Counterexamples to the long-standing conjecture on the complexity
of {BDD} binary operations},
journal = {Inf. Process. Lett.},
volume = {112},
number = {16},
pages = {636--640},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.007},
doi = {10.1016/J.IPL.2012.05.007},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YoshinakaKDAM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuHLC12,
author = {Shiwei Yu and
Ting{-}Zhu Huang and
Xiaoyun Liu and
Wufan Chen},
title = {Information measures based on fractional calculus},
journal = {Inf. Process. Lett.},
volume = {112},
number = {23},
pages = {916--921},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.08.019},
doi = {10.1016/J.IPL.2012.08.019},
timestamp = {Sun, 03 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuHLC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuW12,
author = {Sheng Yu and
Prudence W. H. Wong},
title = {A note on "An optimal online algorithm for single machine scheduling
to minimize total general completion time"},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {55--58},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.09.014},
doi = {10.1016/J.IPL.2011.09.014},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YuW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuYYZ12,
author = {Cui Yu and
Xiaofan Yang and
Luxing Yang and
Jing Zhang},
title = {Routing and wavelength assignment for 3-ary n-cube in array-based
optical network},
journal = {Inf. Process. Lett.},
volume = {112},
number = {6},
pages = {252--256},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.024},
doi = {10.1016/J.IPL.2011.10.024},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuYYZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuanGK12,
author = {Chen Yuan and
Qian Guo and
Haibin Kan},
title = {A novel elementary construction of matching vectors},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {494--496},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.008},
doi = {10.1016/J.IPL.2012.03.008},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuanGK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangC12,
author = {Zongyang Zhang and
Zhenfu Cao},
title = {Concurrent non-malleable statistically hiding commitment},
journal = {Inf. Process. Lett.},
volume = {112},
number = {11},
pages = {443--448},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.003},
doi = {10.1016/J.IPL.2012.03.003},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangCTCHL12,
author = {Yong Zhang and
Francis Y. L. Chin and
Hing{-}Fung Ting and
Joseph Wun{-}Tat Chan and
Xin Han and
Ka{-}Cheong Lam},
title = {Online call control in cellular networks revisited},
journal = {Inf. Process. Lett.},
volume = {112},
number = {1-2},
pages = {21--25},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.005},
doi = {10.1016/J.IPL.2011.10.005},
timestamp = {Thu, 22 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangCTCHL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangL12,
author = {Xin Zhang and
Guizhen Liu},
title = {On edge colorings of 1-planar graphs without adjacent triangles},
journal = {Inf. Process. Lett.},
volume = {112},
number = {4},
pages = {138--142},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.021},
doi = {10.1016/J.IPL.2011.10.021},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangWWL12,
author = {Liting Zhang and
Wenling Wu and
Peng Wang and
Bo Liang},
title = {TrCBC: Another look at {CBC-MAC}},
journal = {Inf. Process. Lett.},
volume = {112},
number = {7},
pages = {302--307},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.01.005},
doi = {10.1016/J.IPL.2012.01.005},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangWWL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangY12,
author = {Tongquan Zhang and
Ying Yin},
title = {The minimum spanning tree problem with non-terminal set},
journal = {Inf. Process. Lett.},
volume = {112},
number = {17-18},
pages = {688--690},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.012},
doi = {10.1016/J.IPL.2012.06.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhengQT12,
author = {Qunxiong Zheng and
Wenfeng Qi and
Tian Tian},
title = {On the distinctness of modular reductions of primitive sequences modulo
square-free odd integers},
journal = {Inf. Process. Lett.},
volume = {112},
number = {22},
pages = {872--875},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.07.006},
doi = {10.1016/J.IPL.2012.07.006},
timestamp = {Mon, 08 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhengQT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zhu12,
author = {Hongli Zhu},
title = {A two stage scheduling with transportation and batching},
journal = {Inf. Process. Lett.},
volume = {112},
number = {19},
pages = {728--731},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.06.013},
doi = {10.1016/J.IPL.2012.06.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zhu12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuGLY12,
author = {Xiaomin Zhu and
Hao Guo and
Shaoshuai Liang and
Xiaoling Yang},
title = {An improved security-aware packet scheduling algorithm in real-time
wireless networks},
journal = {Inf. Process. Lett.},
volume = {112},
number = {7},
pages = {282--288},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.11.018},
doi = {10.1016/J.IPL.2011.11.018},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhuGLY12.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 07:44 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:
