Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:journals/ipl:"
more than 1000 matches, exporting first 1000 hits only!
download as .bib file
@article{DBLP:journals/ipl/AcostaT24,
author = {Nidia Obscura Acosta and
Alexandru I. Tomescu},
title = {Simplicity in Eulerian circuits: Uniqueness and safety},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106421},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106421},
doi = {10.1016/J.IPL.2023.106421},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AcostaT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AgrawalFKMS24,
author = {Akanksha Agrawal and
Henning Fernau and
Philipp Kindermann and
Kevin Mann and
U{\'{e}}verton S. Souza},
title = {Recognizing well-dominated graphs is coNP-complete},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106419},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106419},
doi = {10.1016/J.IPL.2023.106419},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AgrawalFKMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlemanyPuigEF24,
author = {Llu{\'{\i}}s Alemany{-}Puig and
Juan Luis Esteban and
Ramon Ferrer{-}i{-}Cancho},
title = {The maximum linear arrangement problem for trees under projectivity
and planarity},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106400},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106400},
doi = {10.1016/J.IPL.2023.106400},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlemanyPuigEF24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AraujoCGNSS24,
author = {J{\'{u}}lio Ara{\'{u}}jo and
Victor A. Campos and
Darlan Gir{\~{a}}o and
Jo{\~{a}}o Nogueira and
Ant{\'{o}}nio Salgueiro and
Ana Silva},
title = {On the hull number on cycle convexity of graphs},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106420},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106420},
doi = {10.1016/J.IPL.2023.106420},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AraujoCGNSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlazevicCEM24,
author = {Mislav Blazevic and
Stefan Canzar and
Khaled Elbassioni and
Domagoj Matijevic},
title = {Anti Tai mapping for unordered labeled trees},
journal = {Inf. Process. Lett.},
volume = {185},
pages = {106454},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106454},
doi = {10.1016/J.IPL.2023.106454},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BlazevicCEM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrosseDKLUW24,
author = {Caroline Brosse and
Oscar Defrain and
Kazuhiro Kurita and
Vincent Limouzy and
Takeaki Uno and
Kunihiro Wasa},
title = {On the hardness of inclusion-wise minimal separators enumeration},
journal = {Inf. Process. Lett.},
volume = {185},
pages = {106469},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106469},
doi = {10.1016/J.IPL.2023.106469},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BrosseDKLUW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CateFJL24,
author = {Balder ten Cate and
Maurice Funk and
Jean Christoph Jung and
Carsten Lutz},
title = {On the non-efficient {PAC} learnability of conjunctive queries},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106431},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106431},
doi = {10.1016/J.IPL.2023.106431},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CateFJL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DahiyaVMS24,
author = {Yogesh Dahiya and
K. Vignesh and
Meena Mahajan and
Karteek Sreenivasaiah},
title = {Linear threshold functions in decision lists, decision trees, and
depth-2 circuits},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106418},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106418},
doi = {10.1016/J.IPL.2023.106418},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DahiyaVMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DellErbaSTZ24,
author = {Daniele Dell'Erba and
Sven Schewe and
Qiyi Tang and
Tansholpan Zhanabekova},
title = {Semantic flowers for good-for-games and deterministic automata},
journal = {Inf. Process. Lett.},
volume = {185},
pages = {106468},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106468},
doi = {10.1016/J.IPL.2023.106468},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DellErbaSTZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FominGIK24,
author = {Fedor V. Fomin and
Petr A. Golovach and
Tanmay Inamdar and
Tomohiro Koana},
title = {{FPT} approximation and subexponential algorithms for covering few
or many edges},
journal = {Inf. Process. Lett.},
volume = {185},
pages = {106471},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2024.106471},
doi = {10.1016/J.IPL.2024.106471},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FominGIK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gabric24,
author = {Daniel Gabric},
title = {Ranking and unranking bordered and unbordered words},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106452},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106452},
doi = {10.1016/J.IPL.2023.106452},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Gabric24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalesiRZ24,
author = {Nicola Galesi and
Fariba Ranjbar and
Michele Zito},
title = {Vertex-connectivity for node failure identification in Boolean Network
Tomography},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106450},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106450},
doi = {10.1016/J.IPL.2023.106450},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GalesiRZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HasanMR24,
author = {Md. Manzurul Hasan and
Debajyoti Mondal and
Md. Saidur Rahman},
title = {Relating planar graph drawings to planar satisfiability problems},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106446},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106446},
doi = {10.1016/J.IPL.2023.106446},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HasanMR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoppenotS24,
author = {Pierre Hoppenot and
Zolt{\'{a}}n Szigeti},
title = {On reversing arcs to improve arc-connectivity},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106434},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106434},
doi = {10.1016/J.IPL.2023.106434},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HoppenotS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HorschS24,
author = {Florian H{\"{o}}rsch and
Zolt{\'{a}}n Szigeti},
title = {Steiner connectivity problems in hypergraphs},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106428},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106428},
doi = {10.1016/J.IPL.2023.106428},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HorschS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ismailov24,
author = {Vugar E. Ismailov},
title = {Approximation error of single hidden layer neural networks with fixed
weights},
journal = {Inf. Process. Lett.},
volume = {185},
pages = {106467},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106467},
doi = {10.1016/J.IPL.2023.106467},
timestamp = {Sat, 17 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Ismailov24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KitaevP24,
author = {Sergey Kitaev and
Artem V. Pyatkin},
title = {On semi-transitive orientability of split graphs},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106435},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106435},
doi = {10.1016/J.IPL.2023.106435},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KitaevP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Klug24,
author = {Nikolas Klug},
title = {Computing minimal solutions to the ring loading problem},
journal = {Inf. Process. Lett.},
volume = {185},
pages = {106466},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106466},
doi = {10.1016/J.IPL.2023.106466},
timestamp = {Sat, 17 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Klug24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Laber24,
author = {Eduardo Sany Laber},
title = {The computational complexity of some explainable clustering problems},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106437},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106437},
doi = {10.1016/J.IPL.2023.106437},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Laber24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiL24,
author = {Xiaowei Li and
Xiwen Lu},
title = {The facility location problem with maximum distance constraint},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106447},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106447},
doi = {10.1016/J.IPL.2023.106447},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LienardyL24,
author = {Jean Li{\'{e}}nardy and
Fr{\'{e}}d{\'{e}}ric Lafitte},
title = {A weakness in {OCB3} used with short nonces allowing for a break of
authenticity and confidentiality},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106404},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106404},
doi = {10.1016/J.IPL.2023.106404},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LienardyL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinggOW24,
author = {Jonas Lingg and
Mateus de Oliveira Oliveira and
Petra Wolf},
title = {Learning from positive and negative examples: New proof for binary
alphabets},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106427},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106427},
doi = {10.1016/J.IPL.2023.106427},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LinggOW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mackie24,
author = {Maximilien Mackie},
title = {Recursion-free modular arithmetic in the lambda-calculus},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106408},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106408},
doi = {10.1016/J.IPL.2023.106408},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Mackie24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MajiS24,
author = {Sukanya Maji and
Sanjib Sadhu},
title = {Discrete and mixed two-center problems for line segments},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106451},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106451},
doi = {10.1016/J.IPL.2023.106451},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MajiS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ManethS24,
author = {Sebastian Maneth and
Helmut Seidl},
title = {Checking in polynomial time whether or not a regular tree language
is deterministic top-down},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106449},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106449},
doi = {10.1016/J.IPL.2023.106449},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ManethS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Manurangsi24,
author = {Pasin Manurangsi},
title = {A note on hardness of computing recursive teaching dimension},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106429},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106429},
doi = {10.1016/J.IPL.2023.106429},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Manurangsi24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mirzanezhad24,
author = {Majid Mirzanezhad},
title = {On approximate near-neighbors search under the (continuous) Fr{\'{e}}chet
distance in higher dimensions},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106405},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106405},
doi = {10.1016/J.IPL.2023.106405},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mirzanezhad24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MitsunobuSS24,
author = {Takuto Mitsunobu and
Reiji Suda and
Vorapong Suppakitpaisarn},
title = {Worst-case analysis of {LPT} scheduling on a small number of non-identical
processors},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106424},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106424},
doi = {10.1016/J.IPL.2023.106424},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MitsunobuSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MoritaSYY24,
author = {Kohei Morita and
Shinya Shiroshita and
Yutaro Yamaguchi and
Yu Yokoi},
title = {Fast primal-dual update against local weight update in linear assignment
problem and its application},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106432},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106432},
doi = {10.1016/J.IPL.2023.106432},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MoritaSYY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NiesS24,
author = {Andr{\'{e}} Nies and
Frank Stephan},
title = {Word automatic groups of nilpotency class 2},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106426},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106426},
doi = {10.1016/J.IPL.2023.106426},
timestamp = {Sat, 28 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NiesS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PanagiotouR24,
author = {Konstantinos Panagiotou and
Simon Reisser},
title = {The effect of iterativity on adversarial opinion forming},
journal = {Inf. Process. Lett.},
volume = {185},
pages = {106453},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106453},
doi = {10.1016/J.IPL.2023.106453},
timestamp = {Sat, 17 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PanagiotouR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PandaRM24,
author = {B. S. Panda and
Soumyashree Rana and
Sounaka Mishra},
title = {On the complexity of co-secure dominating set problem},
journal = {Inf. Process. Lett.},
volume = {185},
pages = {106463},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106463},
doi = {10.1016/J.IPL.2023.106463},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PandaRM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ParkK24,
author = {Je Hong Park and
Woo{-}Hwan Kim},
title = {Security weakness of a certificate-based proxy signature scheme for
IIoT environments},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106406},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106406},
doi = {10.1016/J.IPL.2023.106406},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ParkK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PattanayakP24,
author = {Debasish Pattanayak and
Andrzej Pelc},
title = {Deterministic treasure hunt and rendezvous in arbitrary connected
graphs},
journal = {Inf. Process. Lett.},
volume = {185},
pages = {106455},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106455},
doi = {10.1016/J.IPL.2023.106455},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PattanayakP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PonsWM24,
author = {Reynaldo Gil Pons and
Max Ward and
Lo{\"{\i}}c Miller},
title = {Finding (\emph{s},\emph{d})-hypernetworks in F-hypergraphs is NP-hard},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106433},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106433},
doi = {10.1016/J.IPL.2023.106433},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PonsWM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/QiuW24,
author = {Guoliang Qiu and
Jiaheng Wang},
title = {Inapproximability of counting independent sets in linear hypergraphs},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106448},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106448},
doi = {10.1016/J.IPL.2023.106448},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/QiuW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ray24,
author = {Arka Ray},
title = {There is no {APTAS} for 2-dimensional vector bin packing: Revisited},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106430},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106430},
doi = {10.1016/J.IPL.2023.106430},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ray24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TanP24,
author = {Chik How Tan and
Theo Fanuela Prabowo},
title = {A new key recovery attack on a code-based signature from the Lyubashevsky
framework},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106422},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106422},
doi = {10.1016/J.IPL.2023.106422},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TanP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/UtsumiNSI24,
author = {Shion Utsumi and
Motoki Nakahashi and
Kosei Sakamoto and
Takanori Isobe},
title = {Exploring the optimality of byte-wise permutations of a piccolo-type
block cipher},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106436},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106436},
doi = {10.1016/J.IPL.2023.106436},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/UtsumiNSI24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VermaPT24,
author = {Bhisham Dev Verma and
Rameshwar Pratap and
Manoj Thakur},
title = {Unbiased estimation of inner product via higher order count sketch},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106407},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106407},
doi = {10.1016/J.IPL.2023.106407},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VermaPT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangXC24,
author = {Shanshan Wang and
Chenglong Xiao and
Emmanuel Casseau},
title = {Algorithms with improved delay for enumerating connected induced subgraphs
of a large cardinality},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106425},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106425},
doi = {10.1016/J.IPL.2023.106425},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangXC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WeiYZZR24,
author = {Qi Wei and
Xiaolin Yao and
Wenxin Zhang and
Ruiyue Zhang and
Yonggong Ren},
title = {On-line exploration of rectangular cellular environments with a rectangular
hole},
journal = {Inf. Process. Lett.},
volume = {185},
pages = {106470},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106470},
doi = {10.1016/J.IPL.2023.106470},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/WeiYZZR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangHK24,
author = {Dar{-}Li Yang and
Yung{-}Tsung Hou and
Wen{-}Hung Kuo},
title = {A short note on "A note on single-machine scheduling with job-dependent
learning effects"},
journal = {Inf. Process. Lett.},
volume = {183},
pages = {106423},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106423},
doi = {10.1016/J.IPL.2023.106423},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangHK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhengKPLZ24,
author = {Lijing Zheng and
Haibin Kan and
Jie Peng and
Yanjun Li and
Yanbin Zheng},
title = {A new class of generalized almost perfect nonlinear monomial functions},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106445},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2023.106445},
doi = {10.1016/J.IPL.2023.106445},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhengKPLZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/000723,
author = {Abhishek Singh},
title = {On the intractability of preemptive single-machine job scheduling
with release times, deadlines, and family setup times},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106305},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106305},
doi = {10.1016/J.IPL.2022.106305},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/000723.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AragonaCCL23,
author = {Riccardo Aragona and
Lorenzo Campioni and
Roberto Civino and
Massimo Lauria},
title = {Verification and generation of unrefinable partitions},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106361},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106361},
doi = {10.1016/J.IPL.2023.106361},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AragonaCCL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AzarCG23,
author = {Yossi Azar and
Ilan Reuven Cohen and
Iftah Gamzu},
title = {The loss of serving in the dark},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106334},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106334},
doi = {10.1016/J.IPL.2022.106334},
timestamp = {Fri, 06 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AzarCG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BannaiIK23,
author = {Hideo Bannai and
Tomohiro I and
Dominik K{\"{o}}ppl},
title = {Longest bordered and periodic subsequences},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106398},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106398},
doi = {10.1016/J.IPL.2023.106398},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BannaiIK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BansalKK23,
author = {Nikhil Bansal and
John Kuszmaul and
William Kuszmaul},
title = {A nearly tight lower bound for the \emph{d}-dimensional cow-path problem},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106389},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106389},
doi = {10.1016/J.IPL.2023.106389},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BansalKK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaruchKS23,
author = {Gilad Baruch and
Shmuel T. Klein and
Dana Shapira},
title = {Guided blocks {WOM} codes},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106312},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106312},
doi = {10.1016/J.IPL.2022.106312},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BaruchKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BercziCKP23,
author = {Krist{\'{o}}f B{\'{e}}rczi and
Karthekeyan Chandrasekaran and
Tam{\'{a}}s Kir{\'{a}}ly and
Aditya Pillai},
title = {Analyzing Residual Random Greedy for monotone submodular maximization},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106340},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106340},
doi = {10.1016/J.IPL.2022.106340},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BercziCKP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BertrandFM23,
author = {Nathalie Bertrand and
Hugo Francon and
Nicolas Markey},
title = {Synchronizing words under {LTL} constraints},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106392},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106392},
doi = {10.1016/J.IPL.2023.106392},
timestamp = {Fri, 09 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BertrandFM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Biswas023,
author = {Aniruddha Biswas and
Palash Sarkar},
title = {On the "majority is least stable" conjecture},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106295},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106295},
doi = {10.1016/J.IPL.2022.106295},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Biswas023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlazejCKKSV23,
author = {V{\'{a}}clav Blazej and
Pratibha Choudhary and
Dusan Knop and
Jan Maty{\'{a}}s Kristan and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Valla},
title = {Polynomial kernels for tracking shortest paths},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106315},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106315},
doi = {10.1016/J.IPL.2022.106315},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BlazejCKKSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CalvoK23,
author = {Miguel Bosch Calvo and
Steven Kelk},
title = {An improved kernel for the flip distance problem on simple convex
polygons},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106381},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106381},
doi = {10.1016/J.IPL.2023.106381},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CalvoK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChakrabortyK23,
author = {Debrup Chakraborty and
Samir Kundu},
title = {On the security of TrCBC},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106320},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106320},
doi = {10.1016/J.IPL.2022.106320},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChakrabortyK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen23,
author = {Wei Chen},
title = {Weakest preconditioned goto axiom},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106329},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106329},
doi = {10.1016/J.IPL.2022.106329},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChoudharyGGKMR23,
author = {Pratibha Choudhary and
Michael T. Goodrich and
Siddharth Gupta and
Hadi Khodabandeh and
Pedro Matias and
Venkatesh Raman},
title = {Improved kernels for tracking paths},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106360},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106360},
doi = {10.1016/J.IPL.2023.106360},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChoudharyGGKMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CiccarelliIP23,
author = {Felice Ciccarelli and
Miriam Di Ianni and
Giancarlo Palumbo},
title = {A note on the satisfactory partition problem: Constant size requirement},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106292},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106292},
doi = {10.1016/J.IPL.2022.106292},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CiccarelliIP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CifuentesST23,
author = {Santiago Cifuentes and
Francisco J. Soulignac and
Pablo Terlisky},
title = {Complexity of solving a system of difference constraints with variables
restricted to a finite set},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106378},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106378},
doi = {10.1016/J.IPL.2023.106378},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CifuentesST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CimattiGGMT23,
author = {Alessandro Cimatti and
Luca Geatti and
Nicola Gigante and
Angelo Montanari and
Stefano Tonetta},
title = {{GR(1)} is equivalent to {R(1)}},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106319},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106319},
doi = {10.1016/J.IPL.2022.106319},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CimattiGGMT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CummingsSS23,
author = {Robert Cummings and
Jeffrey O. Shallit and
Paul Staadecker},
title = {Mesosome avoidance},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106291},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106291},
doi = {10.1016/J.IPL.2022.106291},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CummingsSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CzumajL23,
author = {Artur Czumaj and
Andrzej Lingas},
title = {On parallel time in population protocols},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106314},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106314},
doi = {10.1016/J.IPL.2022.106314},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CzumajL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasLNSS23,
author = {Tapas Das and
Tuomo Lehtil{\"{a}} and
Soumen Nandi and
Sagnik Sen and
D. K. Supraja},
title = {On radio \emph{k}-labeling of the power of the infinite path},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106386},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106386},
doi = {10.1016/J.IPL.2023.106386},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DasLNSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DillencourtG23,
author = {Michael B. Dillencourt and
Michael T. Goodrich},
title = {Simplified Chernoff bounds with powers-of-two probabilities},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106397},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106397},
doi = {10.1016/J.IPL.2023.106397},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DillencourtG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dimos0LS23,
author = {Sotirios Dimos and
Dimitris Fotakis and
Thanasis Lianeas and
Kyriakos Sergis},
title = {Escaping Braess's paradox through approximate Caratheodory's theorem},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106289},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106289},
doi = {10.1016/J.IPL.2022.106289},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Dimos0LS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DiskinE23,
author = {Sahar Diskin and
Dor Elboim},
title = {Heavy and light paths and Hamilton cycles},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106396},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106396},
doi = {10.1016/J.IPL.2023.106396},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DiskinE23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DondiH23,
author = {Riccardo Dondi and
Danny Hermelin},
title = {Computing the \emph{k} densest subgraphs of a graph},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106316},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106316},
doi = {10.1016/J.IPL.2022.106316},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DondiH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Durr23,
author = {Anita D{\"{u}}rr},
title = {Improved bounds for rectangular monotone Min-Plus Product and applications},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106358},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106358},
doi = {10.1016/J.IPL.2023.106358},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Durr23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EchenimP23,
author = {Mnacho Echenim and
Nicolas Peltier},
title = {An undecidability result for Separation Logic with theory reasoning},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106359},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106359},
doi = {10.1016/J.IPL.2023.106359},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EchenimP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ElaroussiNRV23,
author = {Mohammed Elaroussi and
Lhouari Nourine and
Mohammed Said Radjef and
Simon Vilmin},
title = {On the preferred extensions of argumentation frameworks: Bijections
with naive sets},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106354},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106354},
doi = {10.1016/J.IPL.2022.106354},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ElaroussiNRV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Feghali23,
author = {Carl Feghali},
title = {A note on matching-cut in \emph{P}\({}_{\mbox{\emph{t}}}\)-free graphs},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106294},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106294},
doi = {10.1016/J.IPL.2022.106294},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Feghali23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FiorenzaGS23,
author = {Dario Fiorenza and
Daniele Gorla and
Ivano Salvo},
title = {Polynomial recognition of vulnerable multi-commodities},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106282},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106282},
doi = {10.1016/J.IPL.2022.106282},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FiorenzaGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FryganiotisPP23,
author = {Nikolaos Fryganiotis and
Symeon Papavassiliou and
Christos Pelekis},
title = {A note on the network coloring game: {A} randomized distributed ({\(\Delta\)}{\unicode{8239}}+{\unicode{8239}}1)-coloring
algorithm},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106385},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106385},
doi = {10.1016/J.IPL.2023.106385},
timestamp = {Fri, 09 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FryganiotisPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FuHLMXZ23,
author = {Jianling Fu and
Cheng{-}Chao Huang and
Yong Li and
Jingyi Mei and
Ming Xu and
Lijun Zhang},
title = {Quantitative controller synthesis for consumption Markov decision
processes},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106342},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106342},
doi = {10.1016/J.IPL.2022.106342},
timestamp = {Mon, 04 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FuHLMXZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fujito23,
author = {Toshihiro Fujito},
title = {A note on approximations of directed edge dominating set},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106303},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106303},
doi = {10.1016/J.IPL.2022.106303},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fujito23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GeorgiouKLPP23,
author = {Konstantinos Georgiou and
Evangelos Kranakis and
Nikos Leonardos and
Aris Pagourtzis and
Ioannis Papaioannou},
title = {Optimal circle search despite the presence of faulty robots},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106391},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106391},
doi = {10.1016/J.IPL.2023.106391},
timestamp = {Fri, 09 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GeorgiouKLPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GoyalJ23,
author = {Dishant Goyal and
Ragesh Jaiswal},
title = {Tight {FPT} Approximation for Socially Fair Clustering},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106383},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106383},
doi = {10.1016/J.IPL.2023.106383},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GoyalJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrabowskiK23,
author = {Szymon Grabowski and
Dominik K{\"{o}}ppl},
title = {Space-efficient Huffman codes revisited},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106274},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106274},
doi = {10.1016/J.IPL.2022.106274},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GrabowskiK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuingonaKNS23,
author = {Vincent Guingona and
Alexei Kolesnikov and
Julianne Nierwinski and
Avery Schweitzer},
title = {Comparing approximate and probabilistic differential privacy parameters},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106380},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106380},
doi = {10.1016/J.IPL.2023.106380},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuingonaKNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoLW23,
author = {Lifeng Guo and
Changhong Lu and
Guanlin Wu},
title = {Approximation algorithms for a virtual machine allocation problem
with finite types},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106339},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106339},
doi = {10.1016/J.IPL.2022.106339},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuoLW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HentschelHT23,
author = {Brian Hentschel and
Peter J. Haas and
Yuanyuan Tian},
title = {Exact {PPS} sampling with bounded sample size},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106382},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106382},
doi = {10.1016/J.IPL.2023.106382},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HentschelHT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Huang23,
author = {Ming{-}Deh A. Huang},
title = {On product decomposition},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106344},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106344},
doi = {10.1016/J.IPL.2022.106344},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Huang23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IerselMM23,
author = {Leo van Iersel and
Vincent Moulton and
Yukihiro Murakami},
title = {Polynomial invariants for cactuses},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106394},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106394},
doi = {10.1016/J.IPL.2023.106394},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IerselMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ImanaD23,
author = {Jos{\'{e}} Luis Ima{\~{n}}a and
Siemen Dhooghe},
title = {Domain-oriented masked bit-parallel finite-field multiplier against
side-channel attacks},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106395},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106395},
doi = {10.1016/J.IPL.2023.106395},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ImanaD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JanuszewskiZ23,
author = {Janusz Januszewski and
Lukasz Zielonka},
title = {Packing batches of cubes into a single bin},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106337},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106337},
doi = {10.1016/J.IPL.2022.106337},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JanuszewskiZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JowhariR23,
author = {Hossein Jowhari and
Mohsen Rezapour},
title = {Monochromatic partitioning of colored points by lines},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106402},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106402},
doi = {10.1016/J.IPL.2023.106402},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JowhariR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kamiyama23,
author = {Naoyuki Kamiyama},
title = {On optimization problems in acyclic hypergraphs},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106390},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106390},
doi = {10.1016/J.IPL.2023.106390},
timestamp = {Fri, 09 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kamiyama23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KeikhaS23,
author = {Vahideh Keikha and
Maria Saumell},
title = {On Voronoi visibility maps of 1.5D terrains with multiple viewpoints},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106362},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106362},
doi = {10.1016/J.IPL.2023.106362},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KeikhaS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KelkLM23,
author = {Steven Kelk and
Simone Linz and
Ruben Meuwese},
title = {Cyclic generators and an improved linear kernel for the rooted subtree
prune and regraft distance},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106336},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106336},
doi = {10.1016/J.IPL.2022.106336},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KelkLM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KimKNS23,
author = {Youngho Kim and
Munseong Kang and
Joong Chae Na and
Jeong Seop Sim},
title = {Order-preserving pattern matching with scaling},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106333},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106333},
doi = {10.1016/J.IPL.2022.106333},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KimKNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kostolanyi23,
author = {Peter Kostol{\'{a}}nyi},
title = {On some decidability questions concerning supports of rational series},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106290},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106290},
doi = {10.1016/J.IPL.2022.106290},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Kostolanyi23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeW23,
author = {Euiwoong Lee and
Pengxiang Wang},
title = {Strong hardness of approximation for tree transversals},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106352},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106352},
doi = {10.1016/J.IPL.2022.106352},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiG23,
author = {Shuguang Li and
Zhichao Geng},
title = {Bicriteria scheduling on an unbounded parallel-batch machine for minimizing
makespan and maximum cost},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106343},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106343},
doi = {10.1016/J.IPL.2022.106343},
timestamp = {Fri, 06 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiLL023,
author = {Xiangwen Li and
Yangfan Li and
Jian{-}Bo Lv and
Tao Wang},
title = {Strong edge-colorings of sparse graphs with 3{\(\Delta\)}{\unicode{8239}}-{\unicode{8239}}1
colors},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106313},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106313},
doi = {10.1016/J.IPL.2022.106313},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiLL023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiXZW23,
author = {Kang Li and
Fengjun Xiao and
Bingpeng Zhou and
Jinming Wen},
title = {A sharper lower bound on Rankin's constant},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106379},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106379},
doi = {10.1016/J.IPL.2023.106379},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiXZW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Liu23,
author = {Quanquan C. Liu},
title = {A note on improved results for one round distributed clique listing},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106355},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106355},
doi = {10.1016/J.IPL.2022.106355},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Liu23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuTT23,
author = {Zi{-}Yuan Liu and
Yi{-}Fan Tseng and
Raylin Tso},
title = {Cryptanalysis of a round optimal lattice-based multisignature scheme},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106364},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106364},
doi = {10.1016/J.IPL.2023.106364},
timestamp = {Fri, 09 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuTT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuceroS23,
author = {Jorge C. Lucero and
Slawek Staworko},
title = {A note on the class of languages generated by F-systems over regular
languages},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106283},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106283},
doi = {10.1016/J.IPL.2022.106283},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LuceroS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ManethS23,
author = {Sebastian Maneth and
Helmut Seidl},
title = {Deciding origin equivalence of weakly self-nesting macro tree transducers},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106332},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106332},
doi = {10.1016/J.IPL.2022.106332},
timestamp = {Fri, 06 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ManethS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ManurangsiSS23,
author = {Pasin Manurangsi and
Erel Segal{-}Halevi and
Warut Suksompong},
title = {On maximum bipartite matching with separation},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106388},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106388},
doi = {10.1016/J.IPL.2023.106388},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ManurangsiSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MikawaT23,
author = {Kenji Mikawa and
Ken Tanaka},
title = {Efficient linear-time ranking and unranking of derangements},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106288},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106288},
doi = {10.1016/J.IPL.2022.106288},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MikawaT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MinaudP23,
author = {Brice Minaud and
Charalampos Papamanthou},
title = {Generalized cuckoo hashing with a stash, revisited},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106356},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106356},
doi = {10.1016/J.IPL.2022.106356},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MinaudP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MisselbeckWessel23,
author = {Daniel Misselbeck{-}Wessel},
title = {Maximal elements with minimal logic},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106403},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106403},
doi = {10.1016/J.IPL.2023.106403},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MisselbeckWessel23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OmarPD23,
author = {Satyam Omar and
Sahadeo Padhye and
Dhananjoy Dey},
title = {Cryptanalysis of multivariate threshold ring signature schemes},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106357},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106357},
doi = {10.1016/J.IPL.2022.106357},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OmarPD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ParkB23,
author = {Moonju Park and
Hyeongboo Baek},
title = {Determining rate monotonic schedulability of real-time periodic tasks
using continued fractions},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106296},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106296},
doi = {10.1016/J.IPL.2022.106296},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ParkB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PatawarK23,
author = {Maithilee Patawar and
Kalpesh Kapoor},
title = {Density of distinct squares in non-primitive words},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106367},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106367},
doi = {10.1016/J.IPL.2023.106367},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PatawarK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PhamH23,
author = {Canh V. Pham and
Dung K. Ha},
title = {A note for approximating the submodular cover problem over integer
lattice with low adaptive and query complexities},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106393},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106393},
doi = {10.1016/J.IPL.2023.106393},
timestamp = {Fri, 09 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PhamH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PoureidiF23,
author = {Abolfazl Poureidi and
Jafar Fathali},
title = {Algorithmic results in Roman dominating functions on graphs},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106363},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106363},
doi = {10.1016/J.IPL.2023.106363},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PoureidiF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamanSSM23,
author = {Remi Raman and
Shahin John J. S and
R. Subashini and
Subhasree Methirumangalath},
title = {On the parameterized complexity of the Maximum Exposure Problem},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106338},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106338},
doi = {10.1016/J.IPL.2022.106338},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamanSSM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RauchR23,
author = {Johannes Rauch and
Dieter Rautenbach},
title = {Efficiently recognizing graphs with equal independence and annihilation
numbers},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106387},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106387},
doi = {10.1016/J.IPL.2023.106387},
timestamp = {Fri, 09 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RauchR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RaynalT23,
author = {Michel Raynal and
Gadi Taubenfeld},
title = {Corrigendum to "Mutual exclusion in fully anonymous shared memory
systems" [Inf. Process. Lett. 158 {(2020)} 105938]},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106304},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106304},
doi = {10.1016/J.IPL.2022.106304},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RaynalT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RescignoV23,
author = {Adele A. Rescigno and
Ugo Vaccaro},
title = {Bounds and algorithms for generalized superimposed codes},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106365},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106365},
doi = {10.1016/J.IPL.2023.106365},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RescignoV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shang23,
author = {Yilun Shang},
title = {Long paths in heterogeneous random subgraphs of graphs with large
minimum degree},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106401},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106401},
doi = {10.1016/J.IPL.2023.106401},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shang23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TianY23,
author = {Fangyu Tian and
Yuxue Yin},
title = {The odd chromatic number of a toroidal graph is at most 9},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106384},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106384},
doi = {10.1016/J.IPL.2023.106384},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TianY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TrobstV23,
author = {Thorben Tr{\"{o}}bst and
Vijay V. Vazirani},
title = {A real polynomial for bipartite graph minimum weight perfect matchings},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106286},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106286},
doi = {10.1016/J.IPL.2022.106286},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TrobstV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur23,
author = {Dekel Tsur},
title = {Faster deterministic algorithm for Cactus Vertex Deletion},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106317},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106317},
doi = {10.1016/J.IPL.2022.106317},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsur23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur23a,
author = {Dekel Tsur},
title = {Faster deterministic algorithm for Co-Path Set},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106335},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106335},
doi = {10.1016/J.IPL.2022.106335},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tsur23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tucker-Foltz23,
author = {Jamie Tucker{-}Foltz},
title = {Thou shalt covet the average of thy neighbors' cakes},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106341},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106341},
doi = {10.1016/J.IPL.2022.106341},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tucker-Foltz23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Volkovich23,
author = {Ilya Volkovich},
title = {The final nail in the coffin of statistically-secure obfuscator},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106366},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106366},
doi = {10.1016/J.IPL.2023.106366},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Volkovich23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuL23,
author = {Hao Wu and
Huan Long},
title = {Probabilistic weak bisimulation and axiomatization for probabilistic
models},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106399},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106399},
doi = {10.1016/J.IPL.2023.106399},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yang23,
author = {Yuxing Yang},
title = {Embedded edge connectivity of \emph{k}-ary \emph{n}-cubes},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106328},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106328},
doi = {10.1016/J.IPL.2022.106328},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Yang23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zeitz23,
author = {Tim Zeitz},
title = {NP-hardness of shortest path problems in networks with non-FIFO time-dependent
travel times},
journal = {Inf. Process. Lett.},
volume = {179},
pages = {106287},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106287},
doi = {10.1016/J.IPL.2022.106287},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Zeitz23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhaoC23,
author = {Shu{-}Li Zhao and
Jou{-}Ming Chang},
title = {Connectivity, super connectivity and generalized 3-connectivity of
folded divide-and-swap cubes},
journal = {Inf. Process. Lett.},
volume = {182},
pages = {106377},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106377},
doi = {10.1016/J.IPL.2023.106377},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhaoC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhaoY23,
author = {Zishen Zhao and
Qing Ye},
title = {Revisiting lower dimension lattice attacks on {NTRU}},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106353},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106353},
doi = {10.1016/J.IPL.2022.106353},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhaoY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouXZXYGH23,
author = {Yanwei Zhou and
Ran Xu and
Wenzheng Zhang and
Zhe Xia and
Bo Yang and
Chunxiang Gu and
Meijuan Huang},
title = {Public-key encryption scheme with optimal continuous leakage resilience},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106318},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106318},
doi = {10.1016/J.IPL.2022.106318},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhouXZXYGH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Abu-Khzam22,
author = {Faisal N. Abu{-}Khzam},
title = {An improved exact algorithm for minimum dominating set in chordal
graphs},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106206},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106206},
doi = {10.1016/J.IPL.2021.106206},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Abu-Khzam22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Alemany-PuigEF22,
author = {Llu{\'{\i}}s Alemany{-}Puig and
Juan Luis Esteban and
Ramon Ferrer{-}i{-}Cancho},
title = {Minimum projective linearizations of trees in linear time},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106204},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106204},
doi = {10.1016/J.IPL.2021.106204},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Alemany-PuigEF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Alvarez-Rebollar22,
author = {Jose Luis {\'{A}}lvarez{-}Rebollar and
Jorge Cravioto{-}Lagos and
Nestaly Mar{\'{\i}}n and
Erick Sol{\'{\i}}s{-}Villarreal and
Jorge Urrutia},
title = {Representing point sets on the plane as permutations},
journal = {Inf. Process. Lett.},
volume = {175},
pages = {106228},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106228},
doi = {10.1016/J.IPL.2021.106228},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Alvarez-Rebollar22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/An22,
author = {Mingqiang An},
title = {The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness
of graphs},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106247},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106247},
doi = {10.1016/J.IPL.2022.106247},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/An22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AnK22,
author = {Hyung{-}Chan An and
Robert Kleinberg},
title = {A diameter-revealing proof of the Bondy-Lov{\'{a}}sz lemma},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106194},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106194},
doi = {10.1016/J.IPL.2021.106194},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AnK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AndrianariveloR22,
author = {Nirina Andrianarivelo and
Pierre R{\'{e}}ty},
title = {Modular termination of prefix-constrained term rewrite systems},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106207},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106207},
doi = {10.1016/J.IPL.2021.106207},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AndrianariveloR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AntoniadisHKS22,
author = {Antonios Antoniadis and
Ruben Hoeksma and
S{\'{a}}ndor Kisfaludi{-}Bak and
Kevin Schewior},
title = {Online search for a hyperplane in high-dimensional Euclidean space},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106262},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106262},
doi = {10.1016/J.IPL.2022.106262},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AntoniadisHKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtanasiuPZT22,
author = {Adrian Atanasiu and
Ghajendran Poovanandran and
Abdalhadi Abu Zeyneh and
Wen Chean Teh},
title = {Erasure and error correcting ability of Parikh matrices},
journal = {Inf. Process. Lett.},
volume = {175},
pages = {106223},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106223},
doi = {10.1016/J.IPL.2021.106223},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtanasiuPZT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bae22,
author = {Sang Won Bae},
title = {Faster counting empty convex polygons in a planar point set},
journal = {Inf. Process. Lett.},
volume = {175},
pages = {106221},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106221},
doi = {10.1016/J.IPL.2021.106221},
timestamp = {Tue, 18 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Bae22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BanikBBM22,
author = {Aritra Banik and
Bhaswar B. Bhattacharya and
Sujoy Bhore and
Leonardo Mart{\'{\i}}nez{-}Sandoval},
title = {Geometric systems of unbiased representatives},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106232},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106232},
doi = {10.1016/J.IPL.2021.106232},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BanikBBM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarthMWW22,
author = {Dominique Barth and
Thierry Mautor and
Dimitri Watel and
Marc{-}Antoine Weisser},
title = {A polynomial algorithm for deciding the validity of an electrical
distribution tree},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106249},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106249},
doi = {10.1016/J.IPL.2022.106249},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BarthMWW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BelgiN22,
author = {Amir Belgi and
Zeev Nutov},
title = {A polylogarithmic approximation algorithm for 2-edge-connected dominating
set},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106175},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106175},
doi = {10.1016/J.IPL.2021.106175},
timestamp = {Mon, 11 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BelgiN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BerardH22,
author = {B{\'{e}}atrice B{\'{e}}rard and
Serge Haddad},
title = {Revisiting reachability in Polynomial Interrupt Timed Automata},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106208},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106208},
doi = {10.1016/J.IPL.2021.106208},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BerardH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BerardH22a,
author = {B{\'{e}}atrice B{\'{e}}rard and
Serge Haddad},
title = {Corrigendum to "Revisiting reachability in polynomial interrupt timed
automata" [Information Processing Letters 174 {(2022)} 106208]},
journal = {Inf. Process. Lett.},
volume = {175},
pages = {106231},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106231},
doi = {10.1016/J.IPL.2021.106231},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BerardH22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bhateja22,
author = {Puneet Bhateja},
title = {Determining asynchronous test equivalence for probabilistic processes},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106269},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106269},
doi = {10.1016/J.IPL.2022.106269},
timestamp = {Wed, 01 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bhateja22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BhattacharyaFJ22,
author = {Anup Bhattacharya and
Yoav Freund and
Ragesh Jaiswal},
title = {On the \emph{k}-means/median cost function},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106252},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106252},
doi = {10.1016/J.IPL.2022.106252},
timestamp = {Wed, 01 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BhattacharyaFJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Biedl22,
author = {Therese Biedl},
title = {Horton-Strahler number, rooted pathwidth and upward drawings of trees},
journal = {Inf. Process. Lett.},
volume = {175},
pages = {106230},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106230},
doi = {10.1016/J.IPL.2021.106230},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Biedl22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bodwin22,
author = {Greg Bodwin},
title = {A note on distance-preserving graph sparsification},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106205},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106205},
doi = {10.1016/J.IPL.2021.106205},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Bodwin22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Brand22,
author = {Cornelius Brand},
title = {A note on algebraic techniques for subgraph detection},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106242},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106242},
doi = {10.1016/J.IPL.2021.106242},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Brand22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrettellHMP22,
author = {Nick Brettell and
Jake Horsfield and
Andrea Munaro and
Dani{\"{e}}l Paulusma},
title = {List \emph{k}-colouring \emph{P}\({}_{\mbox{\emph{t}}}\)-free graphs:
{A} Mim-width perspective},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106168},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106168},
doi = {10.1016/J.IPL.2021.106168},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrettellHMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenST22,
author = {Da{-}Ren Chen and
Min{-}Zheng Shieh and
Shi{-}Chun Tsai},
title = {The complexity of comparing optimal solutions},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106266},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106266},
doi = {10.1016/J.IPL.2022.106266},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CoutoCJS22,
author = {Fernanda Couto and
Lu{\'{\i}}s Felipe I. Cunha and
Daniel Juventude and
Leandro Santiago},
title = {Strategies for generating tree spanners: Algorithms, heuristics and
optimal graph classes},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106265},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106265},
doi = {10.1016/J.IPL.2022.106265},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CoutoCJS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CsikosM22,
author = {M{\'{o}}nika Csik{\'{o}}s and
Nabil H. Mustafa},
title = {Optimal approximations made easy},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106250},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106250},
doi = {10.1016/J.IPL.2022.106250},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CsikosM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DahlbergHW22,
author = {Axel Dahlberg and
Jonas Helsen and
Stephanie Wehner},
title = {The complexity of the vertex-minor problem},
journal = {Inf. Process. Lett.},
volume = {175},
pages = {106222},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106222},
doi = {10.1016/J.IPL.2021.106222},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DahlbergHW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DavisHPTU22,
author = {Ben Davis and
Hamed Hatami and
William Pires and
Ran Tao and
Hamza Usmani},
title = {On public-coin zero-error randomized communication complexity},
journal = {Inf. Process. Lett.},
volume = {178},
pages = {106293},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106293},
doi = {10.1016/J.IPL.2022.106293},
timestamp = {Sat, 10 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DavisHPTU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Deng22,
author = {Shichuan Deng},
title = {On clustering with discounts},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106272},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106272},
doi = {10.1016/J.IPL.2022.106272},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Deng22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuFW22,
author = {Yusong Du and
Baoying Fan and
Baodian Wei},
title = {A constant-time sampling algorithm for binary Gaussian distribution
over the integers},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106246},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106246},
doi = {10.1016/J.IPL.2022.106246},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DuFW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EchenimIP22,
author = {Mnacho Echenim and
Radu Iosif and
Nicolas Peltier},
title = {Entailment is Undecidable for Symbolic Heap Separation Logic Formul{\ae}
with Non-Established Inductive Rules},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106169},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106169},
doi = {10.1016/J.IPL.2021.106169},
timestamp = {Mon, 11 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EchenimIP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fiorino22,
author = {Guido Fiorino},
title = {A non-clausal tableau calculus for MinSat},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106167},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106167},
doi = {10.1016/J.IPL.2021.106167},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fiorino22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FukunagaRRT22,
author = {Takuro Fukunaga and
R. Ravi and
Oleksandr Rudenko and
Ziye Tang},
title = {Two-level hub Steiner trees},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106209},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106209},
doi = {10.1016/J.IPL.2021.106209},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FukunagaRRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GadducciS22,
author = {Fabio Gadducci and
Francesco Santini},
title = {Distributivity and residuation for lexicographic orders},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106271},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106271},
doi = {10.1016/J.IPL.2022.106271},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GadducciS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GaikwadM22,
author = {Ajinkya Gaikwad and
Soumen Maity},
title = {Globally minimal defensive alliances},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106253},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106253},
doi = {10.1016/J.IPL.2022.106253},
timestamp = {Wed, 01 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GaikwadM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GomezKP22,
author = {Ana{-}Isabel G{\'{o}}mez and
Markus Kiderlen and
Florian Pausinger},
title = {Improved entropy bounds for parity filtered self-timed ring based
random number generators},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106212},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106212},
doi = {10.1016/J.IPL.2021.106212},
timestamp = {Wed, 29 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GomezKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GottliebK22,
author = {Lee{-}Ad Gottlieb and
Aryeh Kontorovich},
title = {Non-uniform packings},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106179},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106179},
doi = {10.1016/J.IPL.2021.106179},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GottliebK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrandoniORSV22,
author = {Fabrizio Grandoni and
Rafail Ostrovsky and
Yuval Rabani and
Leonard J. Schulman and
Rakesh Venkat},
title = {A refined approximation for Euclidean k-means},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106251},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106251},
doi = {10.1016/J.IPL.2022.106251},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrandoniORSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HadzilacosHT22,
author = {Vassos Hadzilacos and
Xing Hu and
Sam Toueg},
title = {Randomized consensus with regular registers},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106173},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106173},
doi = {10.1016/J.IPL.2021.106173},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HadzilacosHT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HakimPR22,
author = {Sheikh Azizul Hakim and
Bishal Basak Papan and
Md. Saidur Rahman},
title = {New results on pairwise compatibility graphs},
journal = {Inf. Process. Lett.},
volume = {178},
pages = {106284},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106284},
doi = {10.1016/J.IPL.2022.106284},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HakimPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangJHZ22,
author = {Yan Huang and
Yan Jin and
Zhi Hu and
Fangguo Zhang},
title = {Optimizing the evaluation of \emph{{\(\mathscr{l}\)}}-isogenous curve
for isogeny-based cryptography},
journal = {Inf. Process. Lett.},
volume = {178},
pages = {106301},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106301},
doi = {10.1016/J.IPL.2022.106301},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HuangJHZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangW22,
author = {Xiaomin Huang and
Chenhao Wang},
title = {Discrete load balancing on complete bipartite graphs},
journal = {Inf. Process. Lett.},
volume = {175},
pages = {106224},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106224},
doi = {10.1016/J.IPL.2021.106224},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HuangW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IerselKMN22,
author = {Leo van Iersel and
Sjors Kole and
Vincent Moulton and
Leonie Nipius},
title = {An algorithm for reconstructing level-2 phylogenetic networks from
trinets},
journal = {Inf. Process. Lett.},
volume = {178},
pages = {106300},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106300},
doi = {10.1016/J.IPL.2022.106300},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IerselKMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IkenmeyerS22,
author = {Christian Ikenmeyer and
Abhiroop Sanyal},
title = {A note on VNP-completeness and border complexity},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106243},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106243},
doi = {10.1016/J.IPL.2021.106243},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/IkenmeyerS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IndzhevK22,
author = {Emil Indzhev and
Stefan Kiefer},
title = {On complementing unambiguous automata and graphs with many cliques
and cocliques},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106270},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106270},
doi = {10.1016/J.IPL.2022.106270},
timestamp = {Wed, 01 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IndzhevK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JainPV22,
author = {Vishesh Jain and
Huy Tuan Pham and
Thuy{-}Duong Vuong},
title = {Spectral independence, coupling, and the spectral gap of the Glauber
dynamics},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106268},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106268},
doi = {10.1016/J.IPL.2022.106268},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JainPV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JanuszewskiZ22,
author = {Janusz Januszewski and
Lukasz Zielonka},
title = {Packing batches of items into a single bin},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106196},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106196},
doi = {10.1016/J.IPL.2021.106196},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JanuszewskiZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JenaJD22,
author = {Sangram Kishor Jena and
Ramesh K. Jallu and
Gautam K. Das},
title = {On \emph{d}-distance \emph{m}-tuple (\emph{{\(\mathscr{l}\)}}, \emph{r})-domination
in graphs},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106178},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106178},
doi = {10.1016/J.IPL.2021.106178},
timestamp = {Thu, 21 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JenaJD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KrauthgamerS22,
author = {Robert Krauthgamer and
Shay Sapir},
title = {Smoothness of Schatten norms and sliding-window matrix streams},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106254},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106254},
doi = {10.1016/J.IPL.2022.106254},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KrauthgamerS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Levin22,
author = {Asaf Levin},
title = {Robust algorithms for preemptive scheduling on uniform machines of
non-increasing job sizes},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106211},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106211},
doi = {10.1016/J.IPL.2021.106211},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Levin22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LoukidesP22,
author = {Grigorios Loukides and
Solon P. Pissis},
title = {All-pairs suffix/prefix in optimal time using Aho-Corasick space},
journal = {Inf. Process. Lett.},
volume = {178},
pages = {106275},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106275},
doi = {10.1016/J.IPL.2022.106275},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LoukidesP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuZG22,
author = {Xiwen Lu and
Kejun Zhao and
Manzhan Gu},
title = {Online single-machine scheduling to minimize the linear combination
of makespans of two agents},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106163},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106163},
doi = {10.1016/J.IPL.2021.106163},
timestamp = {Mon, 11 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuZG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LucaMORSSU22,
author = {Vitor Tocci F. de Luca and
Nestaly Mar{\'{\i}}n and
Fabiano de S. Oliveira and
Adriana Ram{\'{\i}}rez{-}Vigueras and
Oriol Andreu Sol{\'{e}}{-}Pi and
Jayme Luiz Szwarcfiter and
Jorge Urrutia},
title = {Grid straight-line embeddings of trees with a minimum number of bends
per path},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106210},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106210},
doi = {10.1016/J.IPL.2021.106210},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LucaMORSSU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuyKC22,
author = {Erkam L{\"{u}}y and
Zekeriya Y. Karatas and
Olcay Ciftci},
title = {Comment on "An enhanced and secured {RSA} public cryptosystem algorithm
using Chinese remainder theorem (ESRPKC)"},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106263},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106263},
doi = {10.1016/J.IPL.2022.106263},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuyKC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LyonM22,
author = {Merritt R. Lyon and
Hosam M. Mahmoud},
title = {Insertion depth in power-weight trees},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106227},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106227},
doi = {10.1016/J.IPL.2021.106227},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LyonM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MartinPS22,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
title = {Hard problems that quickly become very easy},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106213},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106213},
doi = {10.1016/J.IPL.2021.106213},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MartinPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MienoWNIBT22,
author = {Takuya Mieno and
Kiichi Watanabe and
Yuto Nakashima and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda},
title = {Palindromic trees for a sliding window and its applications},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106174},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106174},
doi = {10.1016/J.IPL.2021.106174},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MienoWNIBT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Molter22,
author = {Hendrik Molter},
title = {The complexity of finding temporal separators under waiting time constraints},
journal = {Inf. Process. Lett.},
volume = {175},
pages = {106229},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106229},
doi = {10.1016/J.IPL.2021.106229},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Molter22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mooij22,
author = {Arjan J. Mooij},
title = {Static type checking without downcast operator},
journal = {Inf. Process. Lett.},
volume = {178},
pages = {106285},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106285},
doi = {10.1016/J.IPL.2022.106285},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mooij22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PA22,
author = {Abidha V. P and
Pradeesha Ashok},
title = {Geometric separability using orthogonal objects},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106245},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106245},
doi = {10.1016/J.IPL.2022.106245},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PA22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Poureidi22,
author = {Abolfazl Poureidi},
title = {On computing the number of (BC-)subtrees, eccentric subtree number,
and global and local means of trees},
journal = {Inf. Process. Lett.},
volume = {178},
pages = {106302},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106302},
doi = {10.1016/J.IPL.2022.106302},
timestamp = {Sat, 10 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Poureidi22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pudlak22,
author = {Pavel Pudl{\'{a}}k},
title = {On matrices potentially useful for tree codes},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106180},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106180},
doi = {10.1016/J.IPL.2021.106180},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Pudlak22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rabinovich22,
author = {Yuri Rabinovich},
title = {A generalization of the Blind Rotating Table game},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106233},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106233},
doi = {10.1016/J.IPL.2021.106233},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Rabinovich22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sahbi22,
author = {Rafik Sahbi},
title = {New sharp lower bound for the quorum coloring number of trees},
journal = {Inf. Process. Lett.},
volume = {178},
pages = {106297},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106297},
doi = {10.1016/J.IPL.2022.106297},
timestamp = {Sat, 10 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sahbi22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sahin22,
author = {B{\"{u}}nyamin Sahin},
title = {New network entropy: The domination entropy of graphs},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106195},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106195},
doi = {10.1016/J.IPL.2021.106195},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Sahin22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SchierreichS22,
author = {Simon Schierreich and
Ondrej Such{\'{y}}},
title = {Waypoint routing on bounded treewidth graphs},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106165},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106165},
doi = {10.1016/J.IPL.2021.106165},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SchierreichS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShibutaniI22,
author = {Kyoji Shibutani and
Tetsu Iwata},
title = {On the (im)possibility of improving the round diffusion of generalized
Feistel structures},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106197},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106197},
doi = {10.1016/J.IPL.2021.106197},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ShibutaniI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShinagawaI22,
author = {Kazuo Shinagawa and
Tetsu Iwata},
title = {Quantum attacks on Sum of Even-Mansour pseudorandom functions},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106172},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106172},
doi = {10.1016/J.IPL.2021.106172},
timestamp = {Mon, 11 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShinagawaI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShubhamPG22,
author = {Shubham and
Surya Prakash and
Pramod Ganapathi},
title = {An Algorithm for the Sequence Alignment with Gap Penalty Problem using
Multiway Divide-and-Conquer and Matrix Transposition},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106166},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106166},
doi = {10.1016/J.IPL.2021.106166},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ShubhamPG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SmythC22,
author = {Ben Smyth and
Michael R. Clarkson},
title = {Surveying definitions of election verifiability},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106267},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106267},
doi = {10.1016/J.IPL.2022.106267},
timestamp = {Wed, 01 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SmythC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Stankovic22,
author = {Aleksa Stankovic},
title = {On regularity of Max-CSPs and Min-CSPs},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106244},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106244},
doi = {10.1016/J.IPL.2022.106244},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Stankovic22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Suppakitpaisarn22,
author = {Vorapong Suppakitpaisarn},
title = {Tight lower bound for average number of terms in optimal double-base
number system using information-theoretic tools},
journal = {Inf. Process. Lett.},
volume = {175},
pages = {106226},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106226},
doi = {10.1016/J.IPL.2021.106226},
timestamp = {Tue, 18 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Suppakitpaisarn22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tankus22,
author = {David Tankus},
title = {Weighted well-covered graphs without cycles of lengths 5, 6 and 7},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106189},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106189},
doi = {10.1016/J.IPL.2021.106189},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tankus22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur22,
author = {Dekel Tsur},
title = {Cluster deletion revisited},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106171},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106171},
doi = {10.1016/J.IPL.2021.106171},
timestamp = {Mon, 11 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsur22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WeiL22,
author = {Yao Wei and
Zihui Liu},
title = {Further results on the second relative greedy weight of 3-dimensional
codes},
journal = {Inf. Process. Lett.},
volume = {178},
pages = {106298},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106298},
doi = {10.1016/J.IPL.2022.106298},
timestamp = {Sat, 10 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WeiL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuZDZ22,
author = {Haoxuan Wu and
Jincheng Zhuang and
Qianheng Duan and
Yuqing Zhu},
title = {Non-uniform birthday problem revisited: Refined analysis and applications
to discrete logarithms},
journal = {Inf. Process. Lett.},
volume = {175},
pages = {106225},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106225},
doi = {10.1016/J.IPL.2021.106225},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuZDZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XiaoK22,
author = {Mingyu Xiao and
Shaowei Kou},
title = {A simple and improved parameterized algorithm for bicluster editing},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106193},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106193},
doi = {10.1016/J.IPL.2021.106193},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/XiaoK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuL22,
author = {Wei Yu and
Zhaohui Liu},
title = {Approximation and polynomial algorithms for the data mule scheduling
with handling time and time span constraints},
journal = {Inf. Process. Lett.},
volume = {178},
pages = {106299},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106299},
doi = {10.1016/J.IPL.2022.106299},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuanQL22,
author = {Jun Yuan and
Huijuan Qiao and
Aixia Liu},
title = {The upper and lower bounds of \emph{R}\({}_{\mbox{\emph{g}}}\)-conditional
diagnosability of networks},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106248},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106248},
doi = {10.1016/J.IPL.2022.106248},
timestamp = {Fri, 30 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YuanQL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zamfirescu22,
author = {Carol T. Zamfirescu},
title = {Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted
subgraphs},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106192},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106192},
doi = {10.1016/J.IPL.2021.106192},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zamfirescu22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangZLC22,
author = {Yubai Zhang and
Zhao Zhang and
Zhaohui Liu and
Qirong Chen},
title = {An asymptotically tight online algorithm for \emph{m}-Steiner Traveling
Salesman Problem},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106177},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106177},
doi = {10.1016/J.IPL.2021.106177},
timestamp = {Thu, 09 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangZLC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuXYYA22,
author = {Fei Zhu and
Feihong Xu and
Xu Yang and
Xun Yi and
Alsharif Abuadbba},
title = {Cryptanalysis and improvements of an efficient certificate-based proxy
signature scheme for IIoT environments},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106170},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106170},
doi = {10.1016/J.IPL.2021.106170},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhuXYYA22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zimmermann22,
author = {Martin Zimmermann},
title = {Approximating the minimal lookahead needed to win infinite games},
journal = {Inf. Process. Lett.},
volume = {177},
pages = {106264},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106264},
doi = {10.1016/J.IPL.2022.106264},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Zimmermann22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZouWWC22,
author = {Meibiao Zou and
Zhifeng Wang and
Jianxin Wang and
Yixin Cao},
title = {End vertices of graph searches on bipartite graphs},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106176},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106176},
doi = {10.1016/J.IPL.2021.106176},
timestamp = {Thu, 30 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZouWWC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zschoche22,
author = {Philipp Zschoche},
title = {A faster parameterized algorithm for temporal matching},
journal = {Inf. Process. Lett.},
volume = {174},
pages = {106181},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106181},
doi = {10.1016/J.IPL.2021.106181},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Zschoche22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/0006021,
author = {Meng Zhang and
Yi Zhang},
title = {Rank and select operations on a word},
journal = {Inf. Process. Lett.},
volume = {172},
pages = {106148},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106148},
doi = {10.1016/J.IPL.2021.106148},
timestamp = {Wed, 08 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/0006021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/0012W21,
author = {Wei Gao and
Weifan Wang},
title = {Tight binding number bound for \emph{P}\({}_{\mbox{{\(\geq\)}3}}\)-factor
uniform graphs},
journal = {Inf. Process. Lett.},
volume = {172},
pages = {106162},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106162},
doi = {10.1016/J.IPL.2021.106162},
timestamp = {Mon, 13 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/0012W21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Abam21,
author = {Mohammad Ali Abam},
title = {Kinetic collision detection for balls},
journal = {Inf. Process. Lett.},
volume = {171},
pages = {106136},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106136},
doi = {10.1016/J.IPL.2021.106136},
timestamp = {Tue, 08 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Abam21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AbamS21,
author = {Mohammad Ali Abam and
Mohammad Javad Rezaei Seraji},
title = {Geodesic spanners for points in {R3} amid axis-parallel boxes},
journal = {Inf. Process. Lett.},
volume = {166},
pages = {106063},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106063},
doi = {10.1016/J.IPL.2020.106063},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AbamS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AggarwalC21,
author = {Divesh Aggarwal and
Eldon Chung},
title = {A note on the concrete hardness of the shortest independent vector
in lattices},
journal = {Inf. Process. Lett.},
volume = {167},
pages = {106065},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106065},
doi = {10.1016/J.IPL.2020.106065},
timestamp = {Mon, 01 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AggarwalC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AilonY21,
author = {Nir Ailon and
Gal Yehuda},
title = {The complexity of computing (almost) orthogonal matrices with \emph{{\(\epsilon\)}}-copies
of the Fourier transform},
journal = {Inf. Process. Lett.},
volume = {165},
pages = {106024},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106024},
doi = {10.1016/J.IPL.2020.106024},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AilonY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Amiri21,
author = {Saeed Akhoondian Amiri},
title = {A note on the fine-grained complexity of {MIS} on regular graphs},
journal = {Inf. Process. Lett.},
volume = {170},
pages = {106123},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106123},
doi = {10.1016/J.IPL.2021.106123},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Amiri21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AndrejicBT21,
author = {Vladica Andrejic and
Alin Bostan and
Milos Tatarevic},
title = {Improved algorithms for left factorial residues},
journal = {Inf. Process. Lett.},
volume = {167},
pages = {106078},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106078},
doi = {10.1016/J.IPL.2020.106078},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AndrejicBT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AtikAE21,
author = {Abd El Fattah El Atik and
Abdallah W. Aboutahoun and
A. Elsaid},
title = {Correct proof of the main result in "The number of spanning trees
of a class of self-similar fractal models" by Ma and Yao},
journal = {Inf. Process. Lett.},
volume = {170},
pages = {106117},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106117},
doi = {10.1016/J.IPL.2021.106117},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AtikAE21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BannaiIM21,
author = {Hideo Bannai and
Shunsuke Inenaga and
Neerja Mhaskar},
title = {Longest previous overlapping factor array},
journal = {Inf. Process. Lett.},
volume = {168},
pages = {106097},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106097},
doi = {10.1016/J.IPL.2021.106097},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BannaiIM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarilCKV21,
author = {Jean{-}Luc Baril and
Giulio Cerbai and
Carine Khalil and
Vincent Vajnovszki},
title = {Catalan and Schr{\"{o}}der permutations sortable by two restricted
stacks},
journal = {Inf. Process. Lett.},
volume = {171},
pages = {106138},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106138},
doi = {10.1016/J.IPL.2021.106138},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BarilCKV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarilDH21,
author = {Ambroise Baril and
Riccardo Dondi and
Mohammad Mehdi Hosseinzadeh},
title = {Hardness and tractability of the \emph{{\(\gamma\)}}-Complete Subgraph
problem},
journal = {Inf. Process. Lett.},
volume = {169},
pages = {106105},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106105},
doi = {10.1016/J.IPL.2021.106105},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BarilDH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BecherC21,
author = {Ver{\'{o}}nica Becher and
Lucas Cort{\'{e}}s},
title = {Extending de Bruijn sequences to larger alphabets},
journal = {Inf. Process. Lett.},
volume = {168},
pages = {106085},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106085},
doi = {10.1016/J.IPL.2020.106085},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BecherC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bednarczyk21,
author = {Bartosz Bednarczyk},
title = {Statistical {EL} is ExpTime-complete},
journal = {Inf. Process. Lett.},
volume = {169},
pages = {106113},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106113},
doi = {10.1016/J.IPL.2021.106113},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bednarczyk21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeyersdorffB21,
author = {Olaf Beyersdorff and
Joshua Blinkhorn},
title = {A simple proof of {QBF} hardness},
journal = {Inf. Process. Lett.},
volume = {168},
pages = {106093},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106093},
doi = {10.1016/J.IPL.2021.106093},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BeyersdorffB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BillsteinS21,
author = {Andreas Billstein and
Rainer Schrader},
title = {A note on integral generalized flows in directed partial 2-trees},
journal = {Inf. Process. Lett.},
volume = {172},
pages = {106147},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106147},
doi = {10.1016/J.IPL.2021.106147},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BillsteinS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BistarelliRS21,
author = {Stefano Bistarelli and
Fabio Rossi and
Francesco Santini},
title = {Kruskal with embedded C-semirings to solve {MST} problems with partially-ordered
costs},
journal = {Inf. Process. Lett.},
volume = {169},
pages = {106107},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106107},
doi = {10.1016/J.IPL.2021.106107},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BistarelliRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrunelliCV21,
author = {Filippo Brunelli and
Pierluigi Crescenzi and
Laurent Viennot},
title = {On computing Pareto optimal paths in weighted time-dependent networks},
journal = {Inf. Process. Lett.},
volume = {168},
pages = {106086},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106086},
doi = {10.1016/J.IPL.2020.106086},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BrunelliCV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CarufelK21,
author = {Jean{-}Lou De Carufel and
Tanvir Kaykobad},
title = {Transforming plane triangulations by simultaneous diagonal flips},
journal = {Inf. Process. Lett.},
volume = {170},
pages = {106120},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106120},
doi = {10.1016/J.IPL.2021.106120},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CarufelK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChakrabortiFHH21,
author = {Debsoumya Chakraborti and
Alan M. Frieze and
Simi Haber and
Mihir Hasabnis},
title = {Isomorphism for random \emph{k}-uniform hypergraphs},
journal = {Inf. Process. Lett.},
volume = {166},
pages = {106039},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106039},
doi = {10.1016/J.IPL.2020.106039},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChakrabortiFHH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenHTW21,
author = {Xujin Chen and
Xiaodong Hu and
Zhongzheng Tang and
Chenhao Wang},
title = {Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility
location game},
journal = {Inf. Process. Lett.},
volume = {168},
pages = {106098},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106098},
doi = {10.1016/J.IPL.2021.106098},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenHTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenX21,
author = {Jie Chen and
Shou{-}Jun Xu},
title = {A characterization of 3-\emph{{\(\gamma\)}}-critical graphs which
are not bicritical},
journal = {Inf. Process. Lett.},
volume = {166},
pages = {106062},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106062},
doi = {10.1016/J.IPL.2020.106062},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChenX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CiceroneDSN21,
author = {Serafino Cicerone and
Mattia D'Emidio and
Gabriele Di Stefano and
Alfredo Navarra},
title = {On the effectiveness of the genetic paradigm for polygonization},
journal = {Inf. Process. Lett.},
volume = {171},
pages = {106134},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106134},
doi = {10.1016/J.IPL.2021.106134},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CiceroneDSN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DevannyGI21,
author = {William E. Devanny and
Michael T. Goodrich and
Sandy Irani},
title = {A competitive analysis for the Start-Gap algorithm for online memory
wear leveling},
journal = {Inf. Process. Lett.},
volume = {166},
pages = {106042},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106042},
doi = {10.1016/J.IPL.2020.106042},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DevannyGI21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DjukanovicBRB21,
author = {Marko Djukanovic and
Christoph Berger and
G{\"{u}}nther R. Raidl and
Christian Blum},
title = {An A\({}^{\mbox{{\unicode{8270}}}}\) search algorithm for the constrained
longest common subsequence problem},
journal = {Inf. Process. Lett.},
volume = {166},
pages = {106041},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106041},
doi = {10.1016/J.IPL.2020.106041},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DjukanovicBRB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Doerr21,
author = {Benjamin Doerr},
title = {Runtime analysis of evolutionary algorithms via symmetry arguments},
journal = {Inf. Process. Lett.},
volume = {166},
pages = {106064},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106064},
doi = {10.1016/J.IPL.2020.106064},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Doerr21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuqueMHH21,
author = {Frank Duque and
Ruy Fabila Monroy and
C{\'{e}}sar Hern{\'{a}}ndez{-}V{\'{e}}lez and
Carlos Hidalgo{-}Toscano},
title = {Counting the number of crossings in geometric graphs},
journal = {Inf. Process. Lett.},
volume = {165},
pages = {106028},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106028},
doi = {10.1016/J.IPL.2020.106028},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DuqueMHH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DybizbanskiS21,
author = {Janusz Dybizbanski and
Andrzej Szepietowski},
title = {Hamiltonian cycles and paths in hypercubes with disjoint faulty edges},
journal = {Inf. Process. Lett.},
volume = {172},
pages = {106157},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106157},
doi = {10.1016/J.IPL.2021.106157},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DybizbanskiS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Engelfriet21,
author = {Joost Engelfriet},
title = {Computability by monadic second-order logic},
journal = {Inf. Process. Lett.},
volume = {167},
pages = {106074},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106074},
doi = {10.1016/J.IPL.2020.106074},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Engelfriet21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EnglertHLLLS21,
author = {Matthias Englert and
Piotr Hofman and
Slawomir Lasota and
Ranko Lazic and
J{\'{e}}r{\^{o}}me Leroux and
Juliusz Straszynski},
title = {A lower bound for the coverability problem in acyclic pushdown {VAS}},
journal = {Inf. Process. Lett.},
volume = {167},
pages = {106079},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106079},
doi = {10.1016/J.IPL.2020.106079},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/EnglertHLLLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FoucaudHL21,
author = {Florent Foucaud and
Herv{\'{e}} Hocquard and
Dimitri Lajou},
title = {Complexity and algorithms for injective edge-coloring in graphs},
journal = {Inf. Process. Lett.},
volume = {170},
pages = {106121},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106121},
doi = {10.1016/J.IPL.2021.106121},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FoucaudHL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fritsch21,
author = {Robin Fritsch},
title = {Online graph exploration on trees, unicyclic graphs and cactus graphs},
journal = {Inf. Process. Lett.},
volume = {168},
pages = {106096},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106096},
doi = {10.1016/J.IPL.2021.106096},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fritsch21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GabricS21,
author = {Daniel Gabric and
Jeffrey O. Shallit},
title = {Borders, palindrome prefixes, and square prefixes},
journal = {Inf. Process. Lett.},
volume = {165},
pages = {106027},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106027},
doi = {10.1016/J.IPL.2020.106027},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GabricS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Giannella21,
author = {Chris R. Giannella},
title = {Instability results for Euclidean distance, nearest neighbor search
on high dimensional Gaussian data},
journal = {Inf. Process. Lett.},
volume = {169},
pages = {106115},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106115},
doi = {10.1016/J.IPL.2021.106115},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Giannella21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GillaniB21,
author = {Iqra Altaf Gillani and
Amitabha Bagchi},
title = {A queueing network-based distributed Laplacian solver for directed
graphs},
journal = {Inf. Process. Lett.},
volume = {166},
pages = {106040},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106040},
doi = {10.1016/J.IPL.2020.106040},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GillaniB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HalldorssonT21,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Tigran Tonoyan},
title = {Computing inductive vertex orderings},
journal = {Inf. Process. Lett.},
volume = {172},
pages = {106159},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106159},
doi = {10.1016/J.IPL.2021.106159},
timestamp = {Wed, 08 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HalldorssonT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HalmanW21,
author = {Nir Halman and
Shmuel Wimer},
title = {Resource allocation in rooted trees subject to sum constraints and
nonlinear cost functions},
journal = {Inf. Process. Lett.},
volume = {170},
pages = {106114},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106114},
doi = {10.1016/J.IPL.2021.106114},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HalmanW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HansenKP21,
author = {Jakob Cetti Hansen and
Adam Husted Kjelstr{\o}m and
Andreas Pavlogiannis},
title = {Tight bounds for reachability problems on one-counter and pushdown
systems},
journal = {Inf. Process. Lett.},
volume = {171},
pages = {106135},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106135},
doi = {10.1016/J.IPL.2021.106135},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HansenKP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HershkowitzKR21,
author = {D. Ellis Hershkowitz and
Gregory Kehne and
R. Ravi},
title = {An optimal rounding for half-integral weighted minimum strongly connected
spanning subgraph},
journal = {Inf. Process. Lett.},
volume = {167},
pages = {106067},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106067},
doi = {10.1016/J.IPL.2020.106067},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HershkowitzKR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ishizuka21,
author = {Takashi Ishizuka},
title = {On the complexity of finding a Caristi's fixed point},
journal = {Inf. Process. Lett.},
volume = {170},
pages = {106119},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106119},
doi = {10.1016/J.IPL.2021.106119},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ishizuka21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jacques21,
author = {Fabien Jacques},
title = {On the chromatic numbers of signed triangular and hexagonal grids},
journal = {Inf. Process. Lett.},
volume = {172},
pages = {106156},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106156},
doi = {10.1016/J.IPL.2021.106156},
timestamp = {Wed, 08 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jacques21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JobsonKL21,
author = {Adam S. Jobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel},
title = {Minimal 2-connected graphs satisfying the even cut condition},
journal = {Inf. Process. Lett.},
volume = {167},
pages = {106080},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106080},
doi = {10.1016/J.IPL.2020.106080},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JobsonKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kamiyama21,
author = {Naoyuki Kamiyama},
title = {The envy-free matching problem with pairwise preferences},
journal = {Inf. Process. Lett.},
volume = {172},
pages = {106158},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106158},
doi = {10.1016/J.IPL.2021.106158},
timestamp = {Wed, 08 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kamiyama21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KaznatcheevP21,
author = {Artem Kaznatcheev and
Prakash Panangaden},
title = {Weighted automata are compact and actively learnable},
journal = {Inf. Process. Lett.},
volume = {171},
pages = {106133},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106133},
doi = {10.1016/J.IPL.2021.106133},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KaznatcheevP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KimC21,
author = {Sung{-}Hwan Kim and
Hwan{-}Gue Cho},
title = {Simpler FM-index for parameterized string matching},
journal = {Inf. Process. Lett.},
volume = {165},
pages = {106026},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106026},
doi = {10.1016/J.IPL.2020.106026},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KimC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KisekK21,
author = {Anja Kisek and
Sandi Klavzar},
title = {Correcting the algorithm for the secure domination number of cographs
by Jha, Pradhan, and Banerjee},
journal = {Inf. Process. Lett.},
volume = {172},
pages = {106155},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106155},
doi = {10.1016/J.IPL.2021.106155},
timestamp = {Wed, 08 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KisekK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KiyomiHO21,
author = {Masashi Kiyomi and
Takashi Horiyama and
Yota Otachi},
title = {Longest common subsequence in sublinear space},
journal = {Inf. Process. Lett.},
volume = {168},
pages = {106084},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106084},
doi = {10.1016/J.IPL.2020.106084},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KiyomiHO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Knop21,
author = {Dusan Knop},
title = {Local linear set on graphs with bounded twin cover number},
journal = {Inf. Process. Lett.},
volume = {170},
pages = {106118},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106118},
doi = {10.1016/J.IPL.2021.106118},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Knop21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KonstantinovaM21,
author = {Elena V. Konstantinova and
Alexey N. Medvedev},
title = {Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort
graph},
journal = {Inf. Process. Lett.},
volume = {168},
pages = {106094},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106094},
doi = {10.1016/J.IPL.2021.106094},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KonstantinovaM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiLC21,
author = {Jing Li and
Xujing Li and
Eddie Cheng},
title = {Super spanning connectivity of split-star networks},
journal = {Inf. Process. Lett.},
volume = {166},
pages = {106037},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106037},
doi = {10.1016/J.IPL.2020.106037},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiLC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaT21,
author = {Yanger Ma and
Tony Tan},
title = {A simple combinatorial proof for the small model property of two-variable
logic},
journal = {Inf. Process. Lett.},
volume = {170},
pages = {106122},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106122},
doi = {10.1016/J.IPL.2021.106122},
timestamp = {Tue, 08 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MaT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Manurangsi21,
author = {Pasin Manurangsi},
title = {Linear discrepancy is {\(\Pi\)}\({}_{\mbox{2}}\)-hard to approximate},
journal = {Inf. Process. Lett.},
volume = {172},
pages = {106164},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106164},
doi = {10.1016/J.IPL.2021.106164},
timestamp = {Wed, 08 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Manurangsi21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mastakas21,
author = {Konstantinos Mastakas},
title = {Drawing a rooted tree as a rooted \emph{y}-monotone minimum spanning
tree},
journal = {Inf. Process. Lett.},
volume = {166},
pages = {106035},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106035},
doi = {10.1016/J.IPL.2020.106035},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Mastakas21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mili21,
author = {Ali Mili},
title = {Differentiators and detectors},
journal = {Inf. Process. Lett.},
volume = {169},
pages = {106111},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106111},
doi = {10.1016/J.IPL.2021.106111},
timestamp = {Wed, 31 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Mili21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ohsaka21,
author = {Naoto Ohsaka},
title = {A fully polynomial parameterized algorithm for counting the number
of reachable vertices in a digraph},
journal = {Inf. Process. Lett.},
volume = {171},
pages = {106137},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106137},
doi = {10.1016/J.IPL.2021.106137},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ohsaka21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OrdanelFA21,
author = {Ivy Ordanel and
Proceso Fernandez and
Henry N. Adorna},
title = {A polynomial time algorithm for the 2-Poset Cover Problem},
journal = {Inf. Process. Lett.},
volume = {169},
pages = {106106},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106106},
doi = {10.1016/J.IPL.2021.106106},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OrdanelFA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OropezaT21,
author = {Marcos Oropeza and
Csaba D. T{\'{o}}th},
title = {Reconstruction of the crossing type of a point set from the compatible
exchange graph of noncrossing spanning trees},
journal = {Inf. Process. Lett.},
volume = {170},
pages = {106116},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106116},
doi = {10.1016/J.IPL.2021.106116},
timestamp = {Tue, 08 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OropezaT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PaluchW21,
author = {Katarzyna Paluch and
Mateusz Wasylkiewicz},
title = {A simple combinatorial algorithm for restricted 2-matchings in subcubic
graphs - via half-edges},
journal = {Inf. Process. Lett.},
volume = {171},
pages = {106146},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106146},
doi = {10.1016/J.IPL.2021.106146},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PaluchW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SabirM21,
author = {Eminjan Sabir and
Jixiang Meng},
title = {Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes},
journal = {Inf. Process. Lett.},
volume = {172},
pages = {106160},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106160},
doi = {10.1016/J.IPL.2021.106160},
timestamp = {Wed, 08 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SabirM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Saxena21,
author = {Sanjeev Saxena},
title = {Zone theorem for arrangements in dimension three},
journal = {Inf. Process. Lett.},
volume = {172},
pages = {106161},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106161},
doi = {10.1016/J.IPL.2021.106161},
timestamp = {Wed, 08 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Saxena21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schilling21,
author = {Judith Schilling},
title = {Results and conjectures on the role of the uniform distribution in
the coupon collector's problem with group drawings},
journal = {Inf. Process. Lett.},
volume = {169},
pages = {106112},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106112},
doi = {10.1016/J.IPL.2021.106112},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Schilling21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shallit21,
author = {Jeffrey O. Shallit},
title = {Robbins and Ardila meet Berstel},
journal = {Inf. Process. Lett.},
volume = {167},
pages = {106081},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106081},
doi = {10.1016/J.IPL.2020.106081},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shallit21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur21,
author = {Dekel Tsur},
title = {Algorithms for deletion problems on split graphs},
journal = {Inf. Process. Lett.},
volume = {167},
pages = {106066},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106066},
doi = {10.1016/J.IPL.2020.106066},
timestamp = {Mon, 01 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tsur21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur21a,
author = {Dekel Tsur},
title = {Kernel for \emph{K}\({}_{\mbox{\emph{t}}}\)-free Edge Deletion},
journal = {Inf. Process. Lett.},
volume = {167},
pages = {106082},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106082},
doi = {10.1016/J.IPL.2020.106082},
timestamp = {Mon, 01 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tsur21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur21b,
author = {Dekel Tsur},
title = {Faster parameterized algorithm for Bicluster Editing},
journal = {Inf. Process. Lett.},
volume = {168},
pages = {106095},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106095},
doi = {10.1016/J.IPL.2021.106095},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsur21b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/UrschelW21,
author = {John C. Urschel and
Jake Wellens},
title = {Testing gap \emph{k}-planarity is NP-complete},
journal = {Inf. Process. Lett.},
volume = {169},
pages = {106083},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106083},
doi = {10.1016/J.IPL.2020.106083},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/UrschelW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangL21,
author = {Longchun Wang and
Qingguo Li},
title = {Representations of stably continuous semi-lattices by information
systems and abstract bases},
journal = {Inf. Process. Lett.},
volume = {165},
pages = {106036},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106036},
doi = {10.1016/J.IPL.2020.106036},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhaoCWW21,
author = {Zishen Zhao and
Shiyao Chen and
Meiqin Wang and
Wei Wang},
title = {Improved cube-attack-like cryptanalysis of reduced-round Ketje-Jr
and Keccak-MAC},
journal = {Inf. Process. Lett.},
volume = {171},
pages = {106124},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106124},
doi = {10.1016/J.IPL.2021.106124},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhaoCWW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Abu-AffashBC20,
author = {A. Karim Abu{-}Affash and
Sujoy Bhore and
Paz Carmi},
title = {Monochromatic plane matchings in bicolored point set},
journal = {Inf. Process. Lett.},
volume = {153},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105860},
doi = {10.1016/J.IPL.2019.105860},
timestamp = {Fri, 15 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Abu-AffashBC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AggarwalM20,
author = {Vaneet Aggarwal and
Ruijiu Mao},
title = {Preemptive scheduling for approximate computing on heterogeneous machines:
Tradeoff between weighted accuracy and makespan},
journal = {Inf. Process. Lett.},
volume = {153},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105870},
doi = {10.1016/J.IPL.2019.105870},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AggarwalM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Alweiss20,
author = {Ryan Alweiss},
title = {Noisy corruption detection},
journal = {Inf. Process. Lett.},
volume = {155},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105897},
doi = {10.1016/J.IPL.2019.105897},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Alweiss20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AmanatidisBM20,
author = {Georgios Amanatidis and
Georgios Birmpas and
Evangelos Markakis},
title = {A simple deterministic algorithm for symmetric submodular maximization
subject to a knapsack constraint},
journal = {Inf. Process. Lett.},
volume = {163},
pages = {106010},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106010},
doi = {10.1016/J.IPL.2020.106010},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AmanatidisBM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AvolioF20,
author = {Matteo Avolio and
Antonio Fuduli},
title = {A subset-sum type formulation of a two-agent single-machine scheduling
problem},
journal = {Inf. Process. Lett.},
volume = {155},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105886},
doi = {10.1016/J.IPL.2019.105886},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AvolioF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BazganCD20,
author = {Cristina Bazgan and
Janka Chleb{\'{\i}}kov{\'{a}} and
Cl{\'{e}}ment Dallard},
title = {Graphs without a partition into two proportionally dense subgraphs},
journal = {Inf. Process. Lett.},
volume = {155},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105877},
doi = {10.1016/J.IPL.2019.105877},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BazganCD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BevernS20,
author = {Ren{\'{e}} van Bevern and
Pavel V. Smirnov},
title = {Optimal-size problem kernels for \emph{d}-Hitting Set in linear time
and space},
journal = {Inf. Process. Lett.},
volume = {163},
pages = {105998},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105998},
doi = {10.1016/J.IPL.2020.105998},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BevernS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Biedl20,
author = {Therese Biedl},
title = {Segment representations with small resolution},
journal = {Inf. Process. Lett.},
volume = {153},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105868},
doi = {10.1016/J.IPL.2019.105868},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Biedl20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BiniazMS20,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel
graphs},
journal = {Inf. Process. Lett.},
volume = {153},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105869},
doi = {10.1016/J.IPL.2019.105869},
timestamp = {Fri, 15 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BiniazMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Blikstad20,
author = {Joakim Blikstad},
title = {On the longest common subsequence of Thue-Morse words},
journal = {Inf. Process. Lett.},
volume = {164},
pages = {106020},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106020},
doi = {10.1016/J.IPL.2020.106020},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Blikstad20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoyarEL20,
author = {Joan Boyar and
Faith Ellen and
Kim S. Larsen},
title = {Randomized distributed online algorithms against adaptive offline
adversaries},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105973},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105973},
doi = {10.1016/J.IPL.2020.105973},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BoyarEL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CastiglioniT20,
author = {Valentina Castiglioni and
Simone Tini},
title = {Raiders of the lost equivalence: Probabilistic branching bisimilarity},
journal = {Inf. Process. Lett.},
volume = {159-160},
pages = {105947},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105947},
doi = {10.1016/J.IPL.2020.105947},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CastiglioniT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CazauxR20,
author = {Bastien Cazaux and
Eric Rivals},
title = {Hierarchical Overlap Graph},
journal = {Inf. Process. Lett.},
volume = {155},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105862},
doi = {10.1016/J.IPL.2019.105862},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CazauxR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chillara20,
author = {Suryajith Chillara},
title = {Slightly improved lower bounds for homogeneous formulas of bounded
depth and bounded individual degree},
journal = {Inf. Process. Lett.},
volume = {156},
pages = {105900},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105900},
doi = {10.1016/J.IPL.2019.105900},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Chillara20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CorreiaIM20,
author = {Alexandre R. S. Correia and
Juliano Iyoda and
Alexandre Mota},
title = {Combining model finder and genetic programming into a general purpose
automatic program synthesizer},
journal = {Inf. Process. Lett.},
volume = {154},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105866},
doi = {10.1016/J.IPL.2019.105866},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CorreiaIM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CuiWW20,
author = {Tingting Cui and
Wei Wang and
Meiqin Wang},
title = {Distinguisher on full-round compression function of {GOST} {R}},
journal = {Inf. Process. Lett.},
volume = {156},
pages = {105902},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105902},
doi = {10.1016/J.IPL.2019.105902},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CuiWW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DattaFLPP20,
author = {Ajoy K. Datta and
Paolo Ferragina and
Lawrence L. Larmore and
Linda Pagli and
Giuseppe Prencipe},
title = {Linear time distributed swap edge algorithms},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105979},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105979},
doi = {10.1016/J.IPL.2020.105979},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DattaFLPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DobraunigMM20,
author = {Christoph Dobraunig and
Florian Mendel and
Bart Mennink},
title = {Practical forgeries for {ORANGE}},
journal = {Inf. Process. Lett.},
volume = {159-160},
pages = {105961},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105961},
doi = {10.1016/J.IPL.2020.105961},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DobraunigMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DokaKPSTT20,
author = {Katerina Doka and
Andreas Kosmatopoulos and
Apostolos Papadopoulos and
Spyros Sioutas and
Kostas Tsichlas and
Dimitrios Tsoumakos},
title = {Dynamic planar range skyline queries in log logarithmic expected time},
journal = {Inf. Process. Lett.},
volume = {162},
pages = {105990},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105990},
doi = {10.1016/J.IPL.2020.105990},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DokaKPSTT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Dragan20,
author = {Feodor F. Dragan},
title = {An eccentricity 2-approximating spanning tree of a chordal graph is
computable in linear time},
journal = {Inf. Process. Lett.},
volume = {154},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105873},
doi = {10.1016/J.IPL.2019.105873},
timestamp = {Mon, 16 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Dragan20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DybizbanskiNS20,
author = {Janusz Dybizbanski and
Anna Nenca and
Andrzej Szepietowski},
title = {Signed coloring of 2-dimensional grids},
journal = {Inf. Process. Lett.},
volume = {156},
pages = {105918},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105918},
doi = {10.1016/J.IPL.2020.105918},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DybizbanskiNS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EriguchiK20,
author = {Reo Eriguchi and
Noboru Kunihiro},
title = {Strong security of linear ramp secret sharing schemes with general
access structures},
journal = {Inf. Process. Lett.},
volume = {164},
pages = {106018},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106018},
doi = {10.1016/J.IPL.2020.106018},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/EriguchiK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FernstromS20,
author = {Finn Fernstr{\o}m and
Teresa Anna Steiner},
title = {A constant approximation algorithm for the uniform a priori capacitated
vehicle routing problem with unit demands},
journal = {Inf. Process. Lett.},
volume = {159-160},
pages = {105960},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105960},
doi = {10.1016/J.IPL.2020.105960},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FernstromS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FleischerRS20,
author = {Lukas Fleischer and
Samin Riasat and
Jeffrey O. Shallit},
title = {New bounds on antipowers in words},
journal = {Inf. Process. Lett.},
volume = {164},
pages = {106021},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106021},
doi = {10.1016/J.IPL.2020.106021},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FleischerRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FranzleQSW20,
author = {Martin Fr{\"{a}}nzle and
Karin Quaas and
Mahsa Shirmohammadi and
James Worrell},
title = {Effective definability of the reachability relation in timed automata},
journal = {Inf. Process. Lett.},
volume = {153},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105871},
doi = {10.1016/J.IPL.2019.105871},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FranzleQSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FujimoriKMS20,
author = {Yusei Fujimori and
Yasushi Kawase and
Tomomi Matsui and
Akiyoshi Shioura},
title = {A fast algorithm for multiprocessor speed-scaling problem minimizing
completion time and energy consumption},
journal = {Inf. Process. Lett.},
volume = {162},
pages = {105991},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105991},
doi = {10.1016/J.IPL.2020.105991},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FujimoriKMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GencIR20,
author = {Ziya Alper Gen{\c{c}} and
Vincenzo Iovino and
Alfredo Rial},
title = {"The simplest protocol for oblivious transfer" revisited},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105975},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105975},
doi = {10.1016/J.IPL.2020.105975},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GencIR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GildeaHKY20,
author = {Joe Gildea and
Holly Hamilton and
Abidin Kaya and
Bahattin Yildiz},
title = {Modified quadratic residue constructions and new extremal binary self-dual
codes of lengths 64, 66 and 68},
journal = {Inf. Process. Lett.},
volume = {157},
pages = {105927},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105927},
doi = {10.1016/J.IPL.2020.105927},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GildeaHKY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Goeminne20,
author = {Aline Goeminne},
title = {Constrained existence of weak subgame perfect equilibria in multiplayer
B{\"{u}}chi games},
journal = {Inf. Process. Lett.},
volume = {163},
pages = {105996},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105996},
doi = {10.1016/J.IPL.2020.105996},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Goeminne20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GonzalezGSS20,
author = {Luc{\'{\i}}a M. Gonz{\'{a}}lez and
Luciano N. Grippo and
Mart{\'{\i}}n D. Safe and
Vin{\'{\i}}cius Fernandes dos Santos},
title = {Covering graphs with convex sets and partitioning graphs into convex
sets},
journal = {Inf. Process. Lett.},
volume = {158},
pages = {105944},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105944},
doi = {10.1016/J.IPL.2020.105944},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GonzalezGSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HaradaS20,
author = {Masaaki Harada and
Ken Saito},
title = {Remark on subcodes of linear complementary dual codes},
journal = {Inf. Process. Lett.},
volume = {159-160},
pages = {105963},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105963},
doi = {10.1016/J.IPL.2020.105963},
timestamp = {Wed, 27 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HaradaS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HayamizuHMM20,
author = {Momoko Hayamizu and
Katharina T. Huber and
Vincent Moulton and
Yukihiro Murakami},
title = {Recognizing and realizing cactus metrics},
journal = {Inf. Process. Lett.},
volume = {157},
pages = {105916},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105916},
doi = {10.1016/J.IPL.2020.105916},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HayamizuHMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HenningPP20,
author = {Michael A. Henning and
Saikat Pal and
Dinabandhu Pradhan},
title = {Algorithm and hardness results on hop domination in graphs},
journal = {Inf. Process. Lett.},
volume = {153},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105872},
doi = {10.1016/J.IPL.2019.105872},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HenningPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HershkowitzK20,
author = {D. Ellis Hershkowitz and
Gregory Kehne},
title = {Reverse greedy is bad for \emph{k}-center},
journal = {Inf. Process. Lett.},
volume = {158},
pages = {105941},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105941},
doi = {10.1016/J.IPL.2020.105941},
timestamp = {Thu, 30 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HershkowitzK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HinrichsenLS20,
author = {Erica G. Hinrichsen and
Valeria A. Leoni and
Mart{\'{\i}}n D. Safe},
title = {Labelled packing functions in graphs},
journal = {Inf. Process. Lett.},
volume = {154},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105863},
doi = {10.1016/J.IPL.2019.105863},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HinrichsenLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HochbaumR20,
author = {Dorit S. Hochbaum and
Xu Rao},
title = {Approximation algorithms for connected maximum coverage problem for
the discovery of mutated driver pathways in cancer},
journal = {Inf. Process. Lett.},
volume = {158},
pages = {105940},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105940},
doi = {10.1016/J.IPL.2020.105940},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HochbaumR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoogKLMU20,
author = {Ivor {van der Hoog} and
Vahideh Keikha and
Maarten L{\"{o}}ffler and
Ali Mohades and
J{\'{e}}r{\^{o}}me Urhausen},
title = {Maximum-area triangle in a convex polygon, revisited},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105943},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105943},
doi = {10.1016/J.IPL.2020.105943},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HoogKLMU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangYZWZX20,
author = {Meijuan Huang and
Bo Yang and
Yi Zhao and
Xin Wang and
Yanwei Zhou and
Zhe Xia},
title = {A generic construction of CCA-secure deterministic encryption},
journal = {Inf. Process. Lett.},
volume = {154},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105865},
doi = {10.1016/J.IPL.2019.105865},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HuangYZWZX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jaiswal20,
author = {Ragesh Jaiswal},
title = {A note on the relation between {XOR} and Selective {XOR} lemmas},
journal = {Inf. Process. Lett.},
volume = {163},
pages = {106011},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106011},
doi = {10.1016/J.IPL.2020.106011},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Jaiswal20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JamshidpourA20,
author = {Sadegh Jamshidpour and
Zahra Ahmadian},
title = {Security analysis of a dynamic threshold secret sharing scheme using
linear subspace method},
journal = {Inf. Process. Lett.},
volume = {163},
pages = {105994},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105994},
doi = {10.1016/J.IPL.2020.105994},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JamshidpourA20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JansenR20,
author = {Klaus Jansen and
Lars Rohwedder},
title = {A note on the integrality gap of the configuration {LP} for restricted
Santa Claus},
journal = {Inf. Process. Lett.},
volume = {164},
pages = {106025},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106025},
doi = {10.1016/J.IPL.2020.106025},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JansenR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JuknaS20,
author = {Stasys Jukna and
Hannes Seiwert},
title = {Sorting can exponentially speed up pure dynamic programming},
journal = {Inf. Process. Lett.},
volume = {159-160},
pages = {105962},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105962},
doi = {10.1016/J.IPL.2020.105962},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JuknaS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KashyopN20,
author = {Manas Jyoti Kashyop and
N. S. Narayanaswamy},
title = {Lazy or eager dynamic matching may not be fast},
journal = {Inf. Process. Lett.},
volume = {162},
pages = {105982},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105982},
doi = {10.1016/J.IPL.2020.105982},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KashyopN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KomarathS20,
author = {Balagopal Komarath and
Nitin Saurabh},
title = {On the complexity of detecting hazards},
journal = {Inf. Process. Lett.},
volume = {162},
pages = {105980},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105980},
doi = {10.1016/J.IPL.2020.105980},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KomarathS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KowalukL20,
author = {Miroslaw Kowaluk and
Andrzej Lingas},
title = {A simple approach to nondecreasing paths},
journal = {Inf. Process. Lett.},
volume = {162},
pages = {105992},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105992},
doi = {10.1016/J.IPL.2020.105992},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KowalukL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LafourcadeL20,
author = {Pascal Lafourcade and
Marius Lombard{-}Platet},
title = {About blockchain interoperability},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105976},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105976},
doi = {10.1016/J.IPL.2020.105976},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LafourcadeL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiPT20,
author = {Yanjun Li and
Jie Peng and
Chik How Tan},
title = {An answer to an open problem of Mesnager on bent functions},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105974},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105974},
doi = {10.1016/J.IPL.2020.105974},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Louza20,
author = {Felipe A. Louza},
title = {A simple algorithm for computing the document array},
journal = {Inf. Process. Lett.},
volume = {154},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105887},
doi = {10.1016/J.IPL.2019.105887},
timestamp = {Fri, 10 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Louza20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LozinMMZ20,
author = {Vadim V. Lozin and
Dmitriy S. Malyshev and
Raffaele Mosca and
Viktor Zamaraev},
title = {Independent domination versus weighted independent domination},
journal = {Inf. Process. Lett.},
volume = {156},
pages = {105914},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105914},
doi = {10.1016/J.IPL.2020.105914},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LozinMMZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuckowF20,
author = {Max{-}Jonathan Luckow and
Till Fluschnik},
title = {On the computational complexity of length- and neighborhood-constrained
path problems},
journal = {Inf. Process. Lett.},
volume = {156},
pages = {105913},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105913},
doi = {10.1016/J.IPL.2019.105913},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LuckowF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaMCH20,
author = {Tianlong Ma and
Yaping Mao and
Eddie Cheng and
Ping Han},
title = {A note on the strong matching preclusion problem for data center networks},
journal = {Inf. Process. Lett.},
volume = {164},
pages = {106007},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106007},
doi = {10.1016/J.IPL.2020.106007},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MaMCH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MafortP20,
author = {Rodrigo Lamblet Mafort and
F{\'{a}}bio Protti},
title = {Vector Domination in split-indifference graphs},
journal = {Inf. Process. Lett.},
volume = {155},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105899},
doi = {10.1016/J.IPL.2019.105899},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MafortP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MayankM20,
author = {Jaishree Mayank and
Arijit Mondal},
title = {Polynomial Time Schedulability Test for Periodic Non-Preemptive 2-Task
System},
journal = {Inf. Process. Lett.},
volume = {154},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105867},
doi = {10.1016/J.IPL.2019.105867},
timestamp = {Mon, 16 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MayankM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MengMHX20,
author = {Keju Meng and
Fuyou Miao and
Wenchao Huang and
Yan Xiong},
title = {Threshold changeable secret sharing with secure secret reconstruction},
journal = {Inf. Process. Lett.},
volume = {157},
pages = {105928},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105928},
doi = {10.1016/J.IPL.2020.105928},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MengMHX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MishibaT20,
author = {Shohei Mishiba and
Yasuhiko Takenaga},
title = {{QUIXO} is EXPTIME-complete},
journal = {Inf. Process. Lett.},
volume = {162},
pages = {105995},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105995},
doi = {10.1016/J.IPL.2020.105995},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MishibaT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MorMS20,
author = {Baruch Mor and
Gur Mosheiov and
Dana Shapira},
title = {Lot scheduling on a single machine to minimize the (weighted) number
of tardy orders},
journal = {Inf. Process. Lett.},
volume = {164},
pages = {106009},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106009},
doi = {10.1016/J.IPL.2020.106009},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MorMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MorrisonG20,
author = {Benjamin Morrison and
Adam Groce},
title = {Oracle separations between quantum and non-interactive zero-knowledge
classes},
journal = {Inf. Process. Lett.},
volume = {154},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105864},
doi = {10.1016/J.IPL.2019.105864},
timestamp = {Mon, 16 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MorrisonG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MuchaS20,
author = {Marcin Mucha and
Marcin Smulewicz},
title = {Improved approximation for Fractionally Subadditive Network Design},
journal = {Inf. Process. Lett.},
volume = {154},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105861},
doi = {10.1016/J.IPL.2019.105861},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MuchaS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MullerK20,
author = {Julian M{\"{u}}ller and
Sven Kosub},
title = {A note on the complexity of manipulating weighted Schulze voting},
journal = {Inf. Process. Lett.},
volume = {162},
pages = {105989},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105989},
doi = {10.1016/J.IPL.2020.105989},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MullerK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MulzerS20,
author = {Wolfgang Mulzer and
Natalia Shenkman},
title = {A constructive proof of a concentration bound for real-valued random
variables},
journal = {Inf. Process. Lett.},
volume = {158},
pages = {105942},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105942},
doi = {10.1016/J.IPL.2020.105942},
timestamp = {Thu, 30 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MulzerS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PaiCC20,
author = {Kung{-}Jui Pai and
Ruay{-}Shiung Chang and
Jou{-}Ming Chang},
title = {A well-equalized 3-CIST partition of alternating group graphs},
journal = {Inf. Process. Lett.},
volume = {155},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105874},
doi = {10.1016/J.IPL.2019.105874},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PaiCC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Paskin-Cherniavsky20,
author = {Anat Paskin{-}Cherniavsky and
Ruxandra F. Olimid},
title = {On cryptographic anonymity and unpredictability in secret sharing},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105965},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105965},
doi = {10.1016/J.IPL.2020.105965},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Paskin-Cherniavsky20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PotechinS20,
author = {Aaron Potechin and
Jeffrey O. Shallit},
title = {Lengths of words accepted by nondeterministic finite automata},
journal = {Inf. Process. Lett.},
volume = {162},
pages = {105993},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105993},
doi = {10.1016/J.IPL.2020.105993},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PotechinS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RahmatiE20,
author = {Zahed Rahmati and
Fatemeh Emami},
title = {{RAC} drawings in subcubic area},
journal = {Inf. Process. Lett.},
volume = {159-160},
pages = {105945},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105945},
doi = {10.1016/J.IPL.2020.105945},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RahmatiE20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamanRS20,
author = {Venkatesh Raman and
M. S. Ramanujan and
Saket Saurabh},
title = {A characterization of K{\"{o}}nig-Egerv{\'{a}}ry graphs
with extendable vertex covers},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105964},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105964},
doi = {10.1016/J.IPL.2020.105964},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RamanRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RaviT20,
author = {Peruvemba Sundaram Ravi and
Levent Tun{\c{c}}el},
title = {Approximation ratio of {LD} algorithm for multi-processor scheduling
and the Coffman-Sethi conjecture},
journal = {Inf. Process. Lett.},
volume = {159-160},
pages = {105959},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105959},
doi = {10.1016/J.IPL.2020.105959},
timestamp = {Wed, 27 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RaviT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RaynalT20,
author = {Michel Raynal and
Gadi Taubenfeld},
title = {Mutual exclusion in fully anonymous shared memory systems},
journal = {Inf. Process. Lett.},
volume = {158},
pages = {105938},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105938},
doi = {10.1016/J.IPL.2020.105938},
timestamp = {Thu, 30 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RaynalT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rukavicka20,
author = {Josef Rukavicka},
title = {Upper bound for the number of closed and privileged words},
journal = {Inf. Process. Lett.},
volume = {156},
pages = {105917},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105917},
doi = {10.1016/J.IPL.2020.105917},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Rukavicka20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sakharov20,
author = {Alexander Sakharov},
title = {Annotated regular expressions and input-driven languages},
journal = {Inf. Process. Lett.},
volume = {159-160},
pages = {105958},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105958},
doi = {10.1016/J.IPL.2020.105958},
timestamp = {Wed, 27 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sakharov20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Severin20,
author = {Daniel Sever{\'{\i}}n},
title = {On the additive chromatic number of several families of graphs},
journal = {Inf. Process. Lett.},
volume = {158},
pages = {105937},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105937},
doi = {10.1016/J.IPL.2020.105937},
timestamp = {Thu, 24 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Severin20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shang20,
author = {Yilun Shang},
title = {Longest distance of a non-uniform dispersion process on the infinite
line},
journal = {Inf. Process. Lett.},
volume = {164},
pages = {106008},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106008},
doi = {10.1016/J.IPL.2020.106008},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shang20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SinghP20,
author = {Sonika Singh and
Sahadeo Padhye},
title = {Identity based blind signature scheme over {NTRU} lattices},
journal = {Inf. Process. Lett.},
volume = {155},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105898},
doi = {10.1016/J.IPL.2019.105898},
timestamp = {Fri, 17 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SinghP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Smyth20,
author = {Ben Smyth},
title = {Surveying global verifiability},
journal = {Inf. Process. Lett.},
volume = {163},
pages = {106000},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106000},
doi = {10.1016/J.IPL.2020.106000},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Smyth20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sokol20,
author = {Dina Sokol},
title = {2-Dimensional palindromes with \emph{k} mismatches},
journal = {Inf. Process. Lett.},
volume = {164},
pages = {106019},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106019},
doi = {10.1016/J.IPL.2020.106019},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sokol20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Stewart20,
author = {Iain A. Stewart},
title = {Variational networks of cube-connected cycles are recursive cubes
of rings},
journal = {Inf. Process. Lett.},
volume = {157},
pages = {105925},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105925},
doi = {10.1016/J.IPL.2020.105925},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Stewart20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sutra20,
author = {Pierre Sutra},
title = {On the correctness of Egalitarian Paxos},
journal = {Inf. Process. Lett.},
volume = {156},
pages = {105901},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105901},
doi = {10.1016/J.IPL.2019.105901},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Sutra20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur20,
author = {Dekel Tsur},
title = {Faster algorithms for cograph edge modification problems},
journal = {Inf. Process. Lett.},
volume = {158},
pages = {105946},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105946},
doi = {10.1016/J.IPL.2020.105946},
timestamp = {Thu, 30 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsur20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur20a,
author = {Dekel Tsur},
title = {An {FPT} algorithm for orthogonal buttons and scissors},
journal = {Inf. Process. Lett.},
volume = {163},
pages = {105997},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105997},
doi = {10.1016/J.IPL.2020.105997},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tsur20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VermaP20,
author = {Shaily Verma and
B. S. Panda},
title = {Grundy coloring in some subclasses of bipartite graphs and their complements},
journal = {Inf. Process. Lett.},
volume = {163},
pages = {105999},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105999},
doi = {10.1016/J.IPL.2020.105999},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VermaP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vigna20,
author = {Sebastiano Vigna},
title = {On the probability of overlap of random subsequences of pseudorandom
number generators},
journal = {Inf. Process. Lett.},
volume = {158},
pages = {105939},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105939},
doi = {10.1016/J.IPL.2020.105939},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vigna20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangQ20,
author = {Maoqun Wang and
Jianguo Qian},
title = {An Ore-type condition for the existence of two disjoint cycles},
journal = {Inf. Process. Lett.},
volume = {159-160},
pages = {105957},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105957},
doi = {10.1016/J.IPL.2020.105957},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangQ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WeimannY20,
author = {Oren Weimann and
Raphael Yuster},
title = {Incremental distance products via faulty shortest paths},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105977},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105977},
doi = {10.1016/J.IPL.2020.105977},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WeimannY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Xiao20,
author = {Han Xiao},
title = {On ideal semicomplete digraphs},
journal = {Inf. Process. Lett.},
volume = {157},
pages = {105903},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105903},
doi = {10.1016/J.IPL.2019.105903},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Xiao20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XiaoN20,
author = {Mingyu Xiao and
Hiroshi Nagamochi},
title = {Some reduction operations to pairwise compatibility graphs},
journal = {Inf. Process. Lett.},
volume = {153},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105875},
doi = {10.1016/J.IPL.2019.105875},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/XiaoN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangXL20,
author = {Yong Zhang and
Jiayi Xian and
Meng{-}Hu Lin},
title = {Online leasing strategy for depreciable equipment considering opportunity
cost},
journal = {Inf. Process. Lett.},
volume = {162},
pages = {105981},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105981},
doi = {10.1016/J.IPL.2020.105981},
timestamp = {Mon, 04 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangXL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Abdel-Ghaffar19,
author = {Khaled A. S. Abdel{-}Ghaffar},
title = {Sets of binary sequences with small total Hamming distances},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {27--29},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.005},
doi = {10.1016/J.IPL.2018.10.005},
timestamp = {Wed, 05 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Abdel-Ghaffar19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Abu-AffashBCC19,
author = {A. Karim Abu{-}Affash and
Sujoy Bhore and
Paz Carmi and
Dibyayan Chakraborty},
title = {Bottleneck bichromatic full Steiner trees},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {14--19},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.003},
doi = {10.1016/J.IPL.2018.10.003},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Abu-AffashBCC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AgostiniBH19,
author = {Matteo Agostini and
Marco Bressan and
Shahrzad Haddadan},
title = {Mixing time bounds for graphlet random walks},
journal = {Inf. Process. Lett.},
volume = {152},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.105851},
doi = {10.1016/J.IPL.2019.105851},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AgostiniBH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AhnABCKOSY19,
author = {Hee{-}Kap Ahn and
Taehoon Ahn and
Sang Won Bae and
Jong Min Choi and
Mincheol Kim and
Eunjin Oh and
Chan{-}Su Shin and
Sang Duk Yoon},
title = {Minimum-width annulus with outliers: Circular, square, and rectangular
cases},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {16--23},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.004},
doi = {10.1016/J.IPL.2019.01.004},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AhnABCKOSY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AkramiMO19,
author = {Hannaneh Akrami and
Kurt Mehlhorn and
Tommy Odland},
title = {Ratio-balanced maximum flows},
journal = {Inf. Process. Lett.},
volume = {150},
pages = {13--17},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.06.003},
doi = {10.1016/J.IPL.2019.06.003},
timestamp = {Wed, 21 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AkramiMO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Aldana-GalvanAC19,
author = {Israel Aldana{-}Galv{\'{a}}n and
Jose Luis {\'{A}}lvarez{-}Rebollar and
Juan Carlos Catana{-}Salazar and
Mazay Jimenez{-}Salinas and
Erick Sol{\'{\i}}s{-}Villarreal and
Jorge Urrutia},
title = {Minimizing the solid angle sum of orthogonal polyhedra},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {47--50},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.11.008},
doi = {10.1016/J.IPL.2018.11.008},
timestamp = {Tue, 05 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Aldana-GalvanAC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AmiriKMR19,
author = {Saeed Akhoondian Amiri and
Stephan Kreutzer and
D{\'{a}}niel Marx and
Roman Rabinovich},
title = {Routing with congestion in acyclic digraphs},
journal = {Inf. Process. Lett.},
volume = {151},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.105836},
doi = {10.1016/J.IPL.2019.105836},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AmiriKMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Arslan19,
author = {Ahmet Arslan},
title = {How sensitive are the term-weighting models of information retrieval
to spam Web pages?},
journal = {Inf. Process. Lett.},
volume = {144},
pages = {16--24},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.12.003},
doi = {10.1016/J.IPL.2018.12.003},
timestamp = {Fri, 08 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Arslan19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BakhsheshF19,
author = {Davood Bakhshesh and
Mohammad Farshi},
title = {Fault tolerancy of continuous Yao graph of angle less than 2\emph{{\(\pi\)}}/5},
journal = {Inf. Process. Lett.},
volume = {148},
pages = {13--18},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.014},
doi = {10.1016/J.IPL.2019.03.014},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BakhsheshF19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BanJPPR19,
author = {Frank Ban and
Kamal Jain and
Christos H. Papadimitriou and
Christos{-}Alexandros Psomas and
Aviad Rubinstein},
title = {Reductions in {PPP}},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {48--52},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.12.009},
doi = {10.1016/J.IPL.2018.12.009},
timestamp = {Fri, 08 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BanJPPR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BhaskaraV19,
author = {Aditya Bhaskara and
Antoine Vigneron},
title = {Approximating a planar convex set using a sparse grid},
journal = {Inf. Process. Lett.},
volume = {149},
pages = {10--13},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.05.002},
doi = {10.1016/J.IPL.2019.05.002},
timestamp = {Wed, 10 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BhaskaraV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BodlaenderZ19,
author = {Hans L. Bodlaender and
Tom C. van der Zanden},
title = {On exploring always-connected temporal graphs of small pathwidth},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {68--71},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.016},
doi = {10.1016/J.IPL.2018.10.016},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BodlaenderZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtM19,
author = {Andreas Brandst{\"{a}}dt and
Martin Milanic},
title = {A dichotomy for weighted efficient dominating sets with bounded degree
vertices},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {30--34},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.007},
doi = {10.1016/J.IPL.2018.10.007},
timestamp = {Wed, 26 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CaiV19,
author = {Xuepeng Cai and
Elkin Vumar},
title = {The super connectivity of folded crossed cubes},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {52--56},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.013},
doi = {10.1016/J.IPL.2018.10.013},
timestamp = {Wed, 05 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CaiV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Carvalho19,
author = {Iago A. Carvalho},
title = {On the statistical evaluation of algorithmic's computational experimentation
with infeasible solutions},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {24--27},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.11.003},
doi = {10.1016/J.IPL.2018.11.003},
timestamp = {Fri, 10 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Carvalho19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CastonguayCCN19,
author = {Diane Castonguay and
Erika M. M. Coelho and
Hebert Coelho and
Julliano R. Nascimento},
title = {On the geodetic number of complementary prisms},
journal = {Inf. Process. Lett.},
volume = {144},
pages = {39--42},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.12.007},
doi = {10.1016/J.IPL.2018.12.007},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CastonguayCCN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chang19,
author = {Ching{-}Lueh Chang},
title = {On Las Vegas approximations for metric 1-median selection},
journal = {Inf. Process. Lett.},
volume = {146},
pages = {44--48},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.007},
doi = {10.1016/J.IPL.2019.02.007},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chang19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Christensen19,
author = {Ren{\'{e}} B{\o}dker Christensen},
title = {On one-round reliable message transmission},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {22--26},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.011},
doi = {10.1016/J.IPL.2019.02.011},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Christensen19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ClareD19,
author = {Amanda Clare and
Jacqueline W. Daykin},
title = {Enhanced string factoring from alphabet orderings},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {4--7},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.011},
doi = {10.1016/J.IPL.2018.10.011},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ClareD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ClarkHP19,
author = {David Clark and
Robert M. Hierons and
Krishna Patel},
title = {Normalised Squeeziness and Failed Error Propagation},
journal = {Inf. Process. Lett.},
volume = {149},
pages = {6--9},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.04.001},
doi = {10.1016/J.IPL.2019.04.001},
timestamp = {Wed, 28 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ClarkHP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DaykinGGLLLMPW19,
author = {Jacqueline W. Daykin and
Richard Groult and
Yannick Guesnet and
Thierry Lecroq and
Arnaud Lefebvre and
Martine L{\'{e}}onard and
Laurent Mouchard and
{\'{E}}lise Prieur and
Bruce W. Watson},
title = {Efficient pattern matching in degenerate strings with the Burrows-Wheeler
transform},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {82--87},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.003},
doi = {10.1016/J.IPL.2019.03.003},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DaykinGGLLLMPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Deng19,
author = {Yun{-}Ping Deng},
title = {Some properties of alternating group networks},
journal = {Inf. Process. Lett.},
volume = {150},
pages = {18--21},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.07.001},
doi = {10.1016/J.IPL.2019.07.001},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Deng19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DolevEHDS19,
author = {Shlomi Dolev and
Anat Eyal and
Danny Hendler and
Philip Derbeko and
Marina Sadetsky},
title = {Upper bounds for multi-level multi-server paging},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {72--76},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.012},
doi = {10.1016/J.IPL.2018.10.012},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DolevEHDS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DosaE19,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein},
title = {A new lower bound on the price of anarchy of selfish bin packing},
journal = {Inf. Process. Lett.},
volume = {150},
pages = {6--12},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.06.002},
doi = {10.1016/J.IPL.2019.06.002},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DosaE19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DyerM19,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Counting independent sets in cocomparability graphs},
journal = {Inf. Process. Lett.},
volume = {144},
pages = {31--36},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.12.005},
doi = {10.1016/J.IPL.2018.12.005},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DyerM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Feghali19,
author = {Carl Feghali},
title = {Paths between colourings of graphs with bounded tree-width},
journal = {Inf. Process. Lett.},
volume = {144},
pages = {37--38},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.12.006},
doi = {10.1016/J.IPL.2018.12.006},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Feghali19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Furst19,
author = {Maximilian F{\"{u}}rst},
title = {On the hardness of deciding the equality of the induced and the uniquely
restricted matching number},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {77--81},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.011},
doi = {10.1016/J.IPL.2019.03.011},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Furst19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FuruyaM19,
author = {Michitaka Furuya and
Naoki Matsumoto},
title = {A note on domination 3-edge-critical planar graphs},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {64--67},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.014},
doi = {10.1016/J.IPL.2018.10.014},
timestamp = {Wed, 26 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FuruyaM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalbyLPR19,
author = {Esther Galby and
Paloma T. Lima and
Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Classifying \emph{k}-edge colouring for \emph{H}-free graphs},
journal = {Inf. Process. Lett.},
volume = {146},
pages = {39--43},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.006},
doi = {10.1016/J.IPL.2019.02.006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GalbyLPR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gerstgrasser19,
author = {Matthias Gerstgrasser},
title = {Reverse auctions are different from auctions},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {49--54},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.006},
doi = {10.1016/J.IPL.2019.03.006},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gerstgrasser19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GhosalR19,
author = {Purnata Ghosal and
B. V. Raghavendra Rao},
title = {A note on parameterized polynomial identity testing using hitting
set generators},
journal = {Inf. Process. Lett.},
volume = {151},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.105839},
doi = {10.1016/J.IPL.2019.105839},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GhosalR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GluckY19,
author = {Robert Gl{\"{u}}ck and
Tetsuo Yokoyama},
title = {Constructing a binary tree from its traversals by reversible recursion
and iteration},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {32--37},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.002},
doi = {10.1016/J.IPL.2019.03.002},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GluckY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoJ19,
author = {Qian Guo and
Thomas Johansson},
title = {A new birthday-type algorithm for attacking the fresh re-keying countermeasure},
journal = {Inf. Process. Lett.},
volume = {146},
pages = {30--34},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.005},
doi = {10.1016/J.IPL.2019.02.005},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuoJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuptaS19,
author = {Ishu Gupta and
Ashutosh Kumar Singh},
title = {Dynamic threshold based information leaker identification scheme},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {69--73},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.005},
doi = {10.1016/J.IPL.2019.03.005},
timestamp = {Thu, 14 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuptaS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GutierresMS19,
author = {Gon{\c{c}}alo Gutierres and
Ricardo Mamede and
Jos{\'{e}} Luis Esteves dos Santos},
title = {Optimal Gray code for involutions},
journal = {Inf. Process. Lett.},
volume = {148},
pages = {19--22},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.04.003},
doi = {10.1016/J.IPL.2019.04.003},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GutierresMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuzelSARC19,
author = {G{\"{u}}ls{\"{u}}m G{\"{o}}zde G{\"{u}}zel and
Muharrem Tolga Sakalli and
Sedat Akleylek and
Vincent Rijmen and
Yasemin Cengellenmis},
title = {A new matrix form to generate all 3{\unicode{8239}}{\texttimes}{\unicode{8239}}3
involutory {MDS} matrices over F2m},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {61--68},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.013},
doi = {10.1016/J.IPL.2019.02.013},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuzelSARC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HalfonS19,
author = {Simon Halfon and
Philippe Schnoebelen},
title = {On shuffle products, acyclic automata and piecewise-testable languages},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {68--73},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.012},
doi = {10.1016/J.IPL.2019.01.012},
timestamp = {Fri, 08 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HalfonS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangP19,
author = {Shang{-}En Huang and
Seth Pettie},
title = {Thorup-Zwick emulators are universally optimal hopsets},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {9--13},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.001},
doi = {10.1016/J.IPL.2018.10.001},
timestamp = {Wed, 26 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HuangP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JainKSS19,
author = {Sanjay Jain and
Bakhadyr Khoussainov and
Philipp Schlicht and
Frank Stephan},
title = {The isomorphism problem for tree-automatic ordinals with addition},
journal = {Inf. Process. Lett.},
volume = {149},
pages = {19--24},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.05.004},
doi = {10.1016/J.IPL.2019.05.004},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JainKSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JannatiK19,
author = {Hoda Jannati and
Ramtin Khosravi},
title = {On the security of one-round meeting location determination protocol},
journal = {Inf. Process. Lett.},
volume = {146},
pages = {35--38},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.004},
doi = {10.1016/J.IPL.2019.02.004},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JannatiK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JhaPB19,
author = {Anupriya Jha and
Dinabandhu Pradhan and
S. Banerjee},
title = {The secure domination problem in cographs},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {30--38},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.005},
doi = {10.1016/J.IPL.2019.01.005},
timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JhaPB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JuknaS19,
author = {Stasys Jukna and
Hannes Seiwert},
title = {Greedy can beat pure dynamic programming},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {90--95},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.018},
doi = {10.1016/J.IPL.2018.10.018},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JuknaS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kamiyama19,
author = {Naoyuki Kamiyama},
title = {A note on balanced flows in equality networks},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {74--76},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.014},
doi = {10.1016/J.IPL.2019.01.014},
timestamp = {Fri, 08 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Kamiyama19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kissel19,
author = {Zachary A. Kissel},
title = {Key regression from constrained pseudorandom functions},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {10--13},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.012},
doi = {10.1016/J.IPL.2019.02.012},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kissel19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KosolobovS19,
author = {Dmitry Kosolobov and
Arseny M. Shur},
title = {Comparison of LZ77-type parsings},
journal = {Inf. Process. Lett.},
volume = {141},
pages = {25--29},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.09.005},
doi = {10.1016/J.IPL.2018.09.005},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KosolobovS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KovalyovMS19,
author = {Mikhail Y. Kovalyov and
Gur Mosheiov and
Dmitrij Sesok},
title = {Comments on "Proportionate flowshops with general position dependent
processing times" [Inf. Process. Lett. 111 and "Minimizing total load
on a proportionate flowshop with position-dependent processing times
and job-rejection" [Inf. Process. Lett. 132 {(2018)} 39-43]},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {1--2},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.008},
doi = {10.1016/J.IPL.2019.02.008},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KovalyovMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kundu19,
author = {Sukhamay Kundu},
title = {Relationship between optimal \emph{k}-distance dominating sets in
a weighted graph and its spanning trees},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {3--5},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.002},
doi = {10.1016/J.IPL.2019.02.002},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kundu19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiJP19,
author = {Rongjia Li and
Chenhui Jin and
Hongchen Pan},
title = {Key recovery attacks on reduced-round Joltik-BC in the single-key
setting},
journal = {Inf. Process. Lett.},
volume = {151},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.105834},
doi = {10.1016/J.IPL.2019.105834},
timestamp = {Sat, 14 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiJP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiTKCL19,
author = {Xiaoyan Li and
Yuan{-}Hsiang Teng and
Tzu{-}Liang Kung and
Qi Chen and
Cheng{-}Kuan Lin},
title = {The diagnosability and 1-good-neighbor conditional diagnosability
of hypercubes with missing links and broken-down nodes},
journal = {Inf. Process. Lett.},
volume = {146},
pages = {20--26},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.007},
doi = {10.1016/J.IPL.2019.01.007},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiTKCL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinX19,
author = {Weibo Lin and
Mingyu Xiao},
title = {A (3{\unicode{8239}}+{\unicode{8239}}\emph{{\unicode{1013}}})\emph{k}-vertex
kernel for edge-disjoint triangle packing},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {20--26},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.006},
doi = {10.1016/J.IPL.2018.10.006},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LinX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuY19,
author = {Ziwen Liu and
Chao Yang},
title = {Hanano Puzzle is NP-hard},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {6--10},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.003},
doi = {10.1016/J.IPL.2019.01.003},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LohreyRS19,
author = {Markus Lohrey and
Carl Philipp Reh and
Kurt Sieber},
title = {Size-optimal top dag compression},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {27--31},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.001},
doi = {10.1016/J.IPL.2019.03.001},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LohreyRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lu19,
author = {Huazhong L{\"{u}}},
title = {On the conjecture of vertex-transitivity of DCell},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {80--83},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.017},
doi = {10.1016/J.IPL.2018.10.017},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lu19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuW19,
author = {Huazhong L{\"{u}} and
Tingzeng Wu},
title = {Edge-disjoint Hamiltonian cycles of balanced hypercubes},
journal = {Inf. Process. Lett.},
volume = {144},
pages = {25--30},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.12.004},
doi = {10.1016/J.IPL.2018.12.004},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LuW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LvXT19,
author = {Xuanjiao Lv and
Lin Xiao and
Zhiguo Tan},
title = {Improved Zhang neural network with finite-time convergence for time-varying
linear system of equations solving},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {88--93},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.012},
doi = {10.1016/J.IPL.2019.03.012},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LvXT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaBW19,
author = {Gang Ma and
Qiuju Bian and
Jianfeng Wang},
title = {The maximum {PI} index of bicyclic graphs with even number of edges},
journal = {Inf. Process. Lett.},
volume = {146},
pages = {13--16},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.001},
doi = {10.1016/J.IPL.2019.02.001},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MaBW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Machacek19,
author = {John M. Machacek},
title = {Partial words with a unique position starting a square},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {44--47},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.010},
doi = {10.1016/J.IPL.2019.01.010},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Machacek19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MadireddyM19,
author = {Raghunath Reddy Madireddy and
Apurva Mudgal},
title = {NP-hardness of geometric set cover and hitting set with rectangles
containing a common point},
journal = {Inf. Process. Lett.},
volume = {141},
pages = {1--8},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.09.002},
doi = {10.1016/J.IPL.2018.09.002},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MadireddyM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MadireddyM19a,
author = {Raghunath Reddy Madireddy and
Apurva Mudgal},
title = {Approximability and hardness of geometric hitting set with axis-parallel
rectangles},
journal = {Inf. Process. Lett.},
volume = {141},
pages = {9--15},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.09.003},
doi = {10.1016/J.IPL.2018.09.003},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MadireddyM19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MakinenN19,
author = {Veli M{\"{a}}kinen and
Tuukka Norri},
title = {Applying the Positional Burrows-Wheeler Transform to all-pairs Hamming
distance},
journal = {Inf. Process. Lett.},
volume = {146},
pages = {17--19},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.003},
doi = {10.1016/J.IPL.2019.02.003},
timestamp = {Mon, 03 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MakinenN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Manurangsi19,
author = {Pasin Manurangsi},
title = {A note on degree vs gap of Min-Rep Label Cover and improved inapproximability
for connectivity problems},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {24--29},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.08.007},
doi = {10.1016/J.IPL.2018.08.007},
timestamp = {Fri, 08 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Manurangsi19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Matsumoto19,
author = {Naoki Matsumoto},
title = {The difference between game chromatic number and chromatic number
of graphs},
journal = {Inf. Process. Lett.},
volume = {151},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.105835},
doi = {10.1016/J.IPL.2019.105835},
timestamp = {Sat, 14 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Matsumoto19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MeyerS19,
author = {Maxime Meyer and
Ben Smyth},
title = {Exploiting re-voting in the Helios election system},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {14--19},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.11.001},
doi = {10.1016/J.IPL.2018.11.001},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MeyerS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Milovanov19,
author = {Alexey Milovanov},
title = {{\#}P-completeness of counting roots of a sparse polynomial},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {77--79},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.09.008},
doi = {10.1016/J.IPL.2018.09.008},
timestamp = {Wed, 05 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Milovanov19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MostefaouiPRC19,
author = {Achour Most{\'{e}}faoui and
Matthieu Perrin and
Michel Raynal and
Jiannong Cao},
title = {Crash-tolerant causal broadcast in \emph{O}(\emph{n}) messages},
journal = {Inf. Process. Lett.},
volume = {151},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.105837},
doi = {10.1016/J.IPL.2019.105837},
timestamp = {Tue, 14 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MostefaouiPRC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mousavi19,
author = {Ramin Mousavi},
title = {Thin trees in 8-edge-connected planar graphs},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {51--55},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.11.009},
doi = {10.1016/J.IPL.2018.11.009},
timestamp = {Fri, 04 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Mousavi19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NevesA19,
author = {Samuel Neves and
Filipe Ara{\'{u}}jo},
title = {An observation on NORX, BLAKE2, and ChaCha},
journal = {Inf. Process. Lett.},
volume = {149},
pages = {1--5},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.05.001},
doi = {10.1016/J.IPL.2019.05.001},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NevesA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NiZX19,
author = {Guanqun Ni and
Feifeng Zheng and
Yinfeng Xu},
title = {Competitive analysis of online revenue management with hierarchical
resources},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {41--45},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.008},
doi = {10.1016/J.IPL.2018.10.008},
timestamp = {Wed, 05 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NiZX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nicholson19,
author = {Patrick K. Nicholson},
title = {Revisiting explicit adaptive two-probe schemes},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {1--3},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.009},
doi = {10.1016/J.IPL.2018.10.009},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Nicholson19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NofalAD19,
author = {Samer Nofal and
Katie Atkinson and
Paul E. Dunne},
title = {On checking skeptical and ideal admissibility in abstract argumentation
frameworks},
journal = {Inf. Process. Lett.},
volume = {148},
pages = {7--12},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.013},
doi = {10.1016/J.IPL.2019.03.013},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NofalAD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PaiC19,
author = {Kung{-}Jui Pai and
Jou{-}Ming Chang},
title = {Improving the diameters of completely independent spanning trees in
locally twisted cubes},
journal = {Inf. Process. Lett.},
volume = {141},
pages = {22--24},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.09.006},
doi = {10.1016/J.IPL.2018.09.006},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PaiC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ParkI19,
author = {Jung{-}Heum Park and
Insung Ihm},
title = {A linear-time algorithm for finding a one-to-many 3-disjoint path
cover in the cube of a connected graph},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {57--63},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.010},
doi = {10.1016/J.IPL.2018.10.010},
timestamp = {Wed, 26 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ParkI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PasalicGZB19,
author = {Enes Pasalic and
Sugata Gangopadhyay and
Wei{-}Guo Zhang and
Samed Bajric},
title = {Design methods for semi-bent functions},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {61--70},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.12.002},
doi = {10.1016/J.IPL.2018.12.002},
timestamp = {Wed, 11 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PasalicGZB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PaulusmaS19,
author = {Dani{\"{e}}l Paulusma and
Stefan Szeider},
title = {On the parameterized complexity of (\emph{k}, \emph{s})-SAT},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {34--36},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.11.005},
doi = {10.1016/J.IPL.2018.11.005},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PaulusmaS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PolakS19,
author = {Sven C. Polak and
Alexander Schrijver},
title = {New lower bound on the Shannon capacity of \emph{C}\({}_{\mbox{7}}\)
from circular graphs},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {37--40},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.11.006},
doi = {10.1016/J.IPL.2018.11.006},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PolakS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReviriegoPL19,
author = {Pedro Reviriego and
Salvatore Pontarelli and
Gil Levy},
title = {CuCoTrack: Cuckoo filter based connection tracking},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {55--60},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.008},
doi = {10.1016/J.IPL.2019.03.008},
timestamp = {Tue, 07 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ReviriegoPL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rial19,
author = {Alfredo Rial},
title = {A conditional access system with revocation for mobile pay-TV systems
revisited},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {6--9},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.010},
doi = {10.1016/J.IPL.2019.02.010},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rial19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RinembergS19,
author = {Mart{\'{\i}}n Rinemberg and
Francisco J. Soulignac},
title = {The eternal dominating set problem for interval graphs},
journal = {Inf. Process. Lett.},
volume = {146},
pages = {27--29},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.013},
doi = {10.1016/J.IPL.2019.01.013},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RinembergS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Roux19,
author = {St{\'{e}}phane Le Roux},
title = {Memoryless determinacy of infinite parity games: Another simple proof},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {8--13},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.015},
doi = {10.1016/J.IPL.2018.10.015},
timestamp = {Fri, 04 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Roux19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SabirM19,
author = {Eminjan Sabir and
Jixiang Meng},
title = {Parallel routing in regular networks with faults},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {84--89},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.019},
doi = {10.1016/J.IPL.2018.10.019},
timestamp = {Wed, 05 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SabirM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SadeghiB19,
author = {Sadegh Sadeghi and
Nasour Bagheri},
title = {Security analysis of {SIMECK} block cipher against related-key impossible
differential},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {14--21},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.02.009},
doi = {10.1016/J.IPL.2019.02.009},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SadeghiB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SanyalD19,
author = {Deepayan Sanyal and
Swagatam Das},
title = {On semi-supervised active clustering of stable instances with oracles},
journal = {Inf. Process. Lett.},
volume = {151},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.105833},
doi = {10.1016/J.IPL.2019.105833},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SanyalD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SchlipfS19,
author = {Lena Schlipf and
Jens M. Schmidt},
title = {Simple computation of st-edge- and st-numberings from ear decompositions},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {58--63},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.008},
doi = {10.1016/J.IPL.2019.01.008},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SchlipfS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShengS19,
author = {Bin Sheng and
Yuefang Sun},
title = {An improved linear kernel for the cycle contraction problem},
journal = {Inf. Process. Lett.},
volume = {149},
pages = {14--18},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.05.003},
doi = {10.1016/J.IPL.2019.05.003},
timestamp = {Wed, 22 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ShengS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shraibman19,
author = {Adi Shraibman},
title = {The corruption bound, log-rank, and communication complexity},
journal = {Inf. Process. Lett.},
volume = {141},
pages = {16--21},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.09.004},
doi = {10.1016/J.IPL.2018.09.004},
timestamp = {Fri, 26 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shraibman19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SialaO19,
author = {Mohamed Siala and
Barry O'Sullivan},
title = {Combinatorial search from an energy perspective},
journal = {Inf. Process. Lett.},
volume = {148},
pages = {23--27},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.04.002},
doi = {10.1016/J.IPL.2019.04.002},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SialaO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Siebertz19,
author = {Sebastian Siebertz},
title = {Greedy domination on biclique-free graphs},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {64--67},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.006},
doi = {10.1016/J.IPL.2019.01.006},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Siebertz19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SrimaniW19,
author = {Pradip K. Srimani and
James Z. Wang},
title = {Self-stabilizing algorithm for two disjoint minimal dominating sets},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {38--43},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.007},
doi = {10.1016/J.IPL.2019.03.007},
timestamp = {Wed, 19 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SrimaniW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/StambouliL19,
author = {Abdelouadoud Stambouli and
Luigi Logrippo},
title = {Data flow analysis from capability lists, with application to {RBAC}},
journal = {Inf. Process. Lett.},
volume = {141},
pages = {30--40},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.09.001},
doi = {10.1016/J.IPL.2018.09.001},
timestamp = {Fri, 26 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/StambouliL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sun19,
author = {Hongyang Sun},
title = {Non-clairvoyant scheduling with conflicts for unit-size jobs},
journal = {Inf. Process. Lett.},
volume = {144},
pages = {1--8},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.12.008},
doi = {10.1016/J.IPL.2018.12.008},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sun19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SunLF19,
author = {Lei Sun and
Jian Liu and
Fang{-}Wei Fu},
title = {Secondary constructions of RSBFs with good cryptographic properties},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {44--48},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.004},
doi = {10.1016/J.IPL.2019.03.004},
timestamp = {Sun, 31 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SunLF19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SurinxB19,
author = {Dimitri Surinx and
Jan Van den Bussche},
title = {A monotone preservation result for Boolean queries expressed as a
containment of conjunctive queries},
journal = {Inf. Process. Lett.},
volume = {150},
pages = {1--5},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.06.001},
doi = {10.1016/J.IPL.2019.06.001},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SurinxB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tatti19,
author = {Nikolaj Tatti},
title = {Strongly polynomial efficient approximation scheme for segmentation},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {1--8},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.09.007},
doi = {10.1016/J.IPL.2018.09.007},
timestamp = {Wed, 26 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tatti19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tell19,
author = {Roei Tell},
title = {Proving that \emph{prBPP}{\unicode{8239}}={\unicode{8239}}\emph{prP}
is as hard as proving that "almost \emph{NP}" is not contained in
\emph{P}/poly},
journal = {Inf. Process. Lett.},
volume = {152},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.105841},
doi = {10.1016/J.IPL.2019.105841},
timestamp = {Mon, 14 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tell19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tille19,
author = {Yves Till{\'{e}}},
title = {A general result for selecting balanced unequal probability samples
from a stream},
journal = {Inf. Process. Lett.},
volume = {152},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.105840},
doi = {10.1016/J.IPL.2019.105840},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Tille19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur19,
author = {Dekel Tsur},
title = {The effective entropy of next/previous larger/smaller value queries},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {39--43},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.011},
doi = {10.1016/J.IPL.2019.01.011},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsur19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur19a,
author = {Dekel Tsur},
title = {Faster parameterized algorithm for pumpkin vertex deletion set},
journal = {Inf. Process. Lett.},
volume = {147},
pages = {74--76},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.009},
doi = {10.1016/J.IPL.2019.03.009},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsur19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ViannaB19,
author = {Henrique Damasceno Vianna and
Jorge Luis Vict{\'{o}}ria Barbosa},
title = {A scalable model for building context-aware applications for noncommunicable
diseases prevention},
journal = {Inf. Process. Lett.},
volume = {148},
pages = {1--6},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.03.010},
doi = {10.1016/J.IPL.2019.03.010},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ViannaB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Voudouris19,
author = {Alexandros A. Voudouris},
title = {A note on the efficiency of position mechanisms with budget constraints},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {28--33},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.11.004},
doi = {10.1016/J.IPL.2018.11.004},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Voudouris19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuXCK19,
author = {Chenhuang Wu and
Chunxiang Xu and
Zhixiong Chen and
Pinhui Ke},
title = {On error linear complexity of new generalized cyclotomic binary sequences
of period \emph{p}\({}^{\mbox{2}}\)},
journal = {Inf. Process. Lett.},
volume = {144},
pages = {9--15},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.08.006},
doi = {10.1016/J.IPL.2018.08.006},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuXCK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XiaoLTZLCJL19,
author = {Lin Xiao and
Kenli Li and
Zhiguo Tan and
Zhijun Zhang and
Bolin Liao and
Ke Chen and
Long Jin and
Shuai Li},
title = {Nonlinear gradient neural network for solving system of linear equations},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {35--40},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.004},
doi = {10.1016/J.IPL.2018.10.004},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XiaoLTZLCJL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Yamamoto19,
author = {Hiroaki Yamamoto},
title = {A faster algorithm for finding shortest substring matches of a regular
expression},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {56--60},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.12.001},
doi = {10.1016/J.IPL.2018.12.001},
timestamp = {Fri, 04 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Yamamoto19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangZ19,
author = {Yuxing Yang and
Lingling Zhang},
title = {Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {11--15},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.002},
doi = {10.1016/J.IPL.2019.01.002},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YangZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuC19,
author = {Unjong Yu and
Jeong{-}Ok Choi},
title = {A note on general epidemic region for infinite regular graphs},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {41--46},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.11.007},
doi = {10.1016/J.IPL.2018.11.007},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YuC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuanH19,
author = {Yuan Yuan and
Rong{-}Xia Hao},
title = {A degree condition for fractional [\emph{a}, \emph{b}]-covered graphs},
journal = {Inf. Process. Lett.},
volume = {143},
pages = {20--23},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.11.002},
doi = {10.1016/J.IPL.2018.11.002},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YuanH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YusufER19,
author = {Marwa Yusuf and
Ahmed El{-}Mahdy and
Erven Rohou},
title = {Towards automatic binary runtime loop de-parallelization using on-stack
replacement},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {53--57},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.009},
doi = {10.1016/J.IPL.2019.01.009},
timestamp = {Tue, 21 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YusufER19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangLZX19,
author = {E. Zhang and
Ming Liu and
Feifeng Zheng and
Yinfeng Xu},
title = {Single machine lot scheduling to minimize the total weighted (discounted)
completion time},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {46--51},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.002},
doi = {10.1016/J.IPL.2018.10.002},
timestamp = {Wed, 26 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangLZX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhaoZ19,
author = {Chunhuan Zhao and
Zhongxiang Zheng},
title = {Improved analysis of the reduction from {BDD} to uSVP},
journal = {Inf. Process. Lett.},
volume = {148},
pages = {28--32},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.04.004},
doi = {10.1016/J.IPL.2019.04.004},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhaoZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouXS19,
author = {Sizhong Zhou and
Yang Xu and
Zhiren Sun},
title = {Degree conditions for fractional (\emph{a}, \emph{b}, \emph{k})-critical
covered graphs},
journal = {Inf. Process. Lett.},
volume = {152},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.105838},
doi = {10.1016/J.IPL.2019.105838},
timestamp = {Mon, 18 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhouXS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuLNB19,
author = {Chun Jiang Zhu and
Kam{-}yiu Lam and
Joseph Kee{-}Yin Ng and
Jinbo Bi},
title = {On the VC-dimension of unique round-trip shortest path systems},
journal = {Inf. Process. Lett.},
volume = {145},
pages = {1--5},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.001},
doi = {10.1016/J.IPL.2019.01.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhuLNB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuMZ19,
author = {Changming Zhu and
Chengjiu Mei and
Rigui Zhou},
title = {Weight-based label-unknown multi-view data set generation approach},
journal = {Inf. Process. Lett.},
volume = {146},
pages = {1--12},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2019.01.015},
doi = {10.1016/J.IPL.2019.01.015},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhuMZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AbrishamiR18,
author = {Gholamreza Abrishami and
Freydoon Rahbarnia},
title = {Polynomial-time algorithm for weighted efficient domination problem
on diameter three planar graphs},
journal = {Inf. Process. Lett.},
volume = {140},
pages = {25--29},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.08.002},
doi = {10.1016/J.IPL.2018.08.002},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AbrishamiR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AgrawalT18,
author = {Neha Agrawal and
Shashikala Tapaswi},
title = {Low rate cloud DDoS attack defense method based on power spectral
density analysis},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {44--50},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.001},
doi = {10.1016/J.IPL.2018.06.001},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AgrawalT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AichholzerADMFP18,
author = {Oswin Aichholzer and
Nieves Atienza and
Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
Ruy Fabila Monroy and
David Flores{-}Pe{\~{n}}aloza and
Pablo P{\'{e}}rez{-}Lantero and
Birgit Vogtenhuber and
Jorge Urrutia},
title = {Computing balanced islands in two colored point sets in the plane},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {28--32},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.008},
doi = {10.1016/J.IPL.2018.02.008},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AichholzerADMFP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AldaS18,
author = {Francesco Ald{\`{a}} and
Hans Ulrich Simon},
title = {A lower bound on the release of differentially private integer partitions},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {1--4},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.001},
doi = {10.1016/J.IPL.2017.09.001},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AldaS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AnX18,
author = {Mingqiang An and
Liming Xiong},
title = {Some results on the inverse sum indeg index of a graph},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {42--46},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.006},
doi = {10.1016/J.IPL.2018.02.006},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AnX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AnastasiadisCD18,
author = {M. Anastasiadis and
N. Chatzis and
Konstantinos A. Draziotis},
title = {Birthday type attacks to the Naccache-Stern knapsack cryptosystem},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {39--43},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.002},
doi = {10.1016/J.IPL.2018.06.002},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AnastasiadisCD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AndreL18,
author = {{\'{E}}tienne Andr{\'{e}} and
Shang{-}Wei Lin},
title = {The language preservation problem is undecidable for parametric event-recording
automata},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {17--20},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.013},
doi = {10.1016/J.IPL.2018.03.013},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AndreL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AngeliniL18,
author = {Patrizio Angelini and
Giordano Da Lozzo},
title = {3-coloring arrangements of line segments with 4 slopes is hard},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {47--50},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.002},
doi = {10.1016/J.IPL.2018.05.002},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AngeliniL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArgiroffoLT18,
author = {Gabriela R. Argiroffo and
Valeria A. Leoni and
Pablo Daniel Torres},
title = {Complexity of \emph{k}-tuple total and total \{\emph{k}\}-dominations
for some subclasses of bipartite graphs},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {75--80},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.007},
doi = {10.1016/J.IPL.2018.06.007},
timestamp = {Mon, 23 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArgiroffoLT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Arslan18,
author = {Abdullah N. Arslan},
title = {A fast algorithm for all-pairs Hamming distances},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {49--52},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.07.006},
doi = {10.1016/J.IPL.2018.07.006},
timestamp = {Thu, 27 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Arslan18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AvinHLS18,
author = {Chen Avin and
Alexandr Hercules and
Andreas Loukas and
Stefan Schmid},
title = {\emph{rDAN}: Toward robust demand-aware network designs},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {5--9},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.008},
doi = {10.1016/J.IPL.2017.12.008},
timestamp = {Mon, 06 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AvinHLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AzarCL18,
author = {Yossi Azar and
Jaya Prakash Champati and
Ben Liang},
title = {2-Approximation algorithm for a generalization of scheduling on unrelated
parallel machines},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {39--43},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.07.005},
doi = {10.1016/J.IPL.2018.07.005},
timestamp = {Tue, 13 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AzarCL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BadkobehFP18,
author = {Golnaz Badkobeh and
Gabriele Fici and
Simon J. Puglisi},
title = {Algorithms for anti-powers in strings},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {57--60},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.003},
doi = {10.1016/J.IPL.2018.05.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BadkobehFP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BampasKPP18,
author = {Evangelos Bampas and
Christina Karousatou and
Aris Pagourtzis and
Katerina Potika},
title = {Path multicoloring in spider graphs with even color multiplicity},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {1--4},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.009},
doi = {10.1016/J.IPL.2017.12.009},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BampasKPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BhavaniJ18,
author = {K. Bhavani and
Sudarson Jena},
title = {Exchanged folded crossed cube: {A} new interconnection network for
parallel computation},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {40--46},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.017},
doi = {10.1016/J.IPL.2018.04.017},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BhavaniJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BijlsmaPPS18,
author = {A. Bijlsma and
Harrie J. M. Passier and
Harold Pootjes and
Sylvia Stuurman},
title = {Template Method test pattern},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {8--12},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.008},
doi = {10.1016/J.IPL.2018.06.008},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BijlsmaPPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BiletskiyBRBA18,
author = {Yevgen Biletskiy and
J. Anthony Brown and
Girish R. Ranganathan and
Ebrahim Bagheri and
Ismail Akbari},
title = {Building a business domain meta-ontology for information pre-processing},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {81--88},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.009},
doi = {10.1016/J.IPL.2018.06.009},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BiletskiyBRBA18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BonamyDFJP18,
author = {Marthe Bonamy and
Konrad K. Dabrowski and
Carl Feghali and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Independent feedback vertex sets for graphs of bounded diameter},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {26--32},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.004},
doi = {10.1016/J.IPL.2017.11.004},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BonamyDFJP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BouchardDPP18,
author = {S{\'{e}}bastien Bouchard and
Yoann Dieudonn{\'{e}} and
Andrzej Pelc and
Franck Petit},
title = {On deterministic rendezvous at a node of agents with arbitrary velocities},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {39--43},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.003},
doi = {10.1016/J.IPL.2018.01.003},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BouchardDPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Brandenburg18,
author = {Franz J. Brandenburg},
title = {On fan-crossing and fan-crossing free graphs},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {67--71},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.006},
doi = {10.1016/J.IPL.2018.06.006},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Brandenburg18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BringmannK18,
author = {Karl Bringmann and
Sebastian Krinninger},
title = {A note on hardness of diameter approximation},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {10--15},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.010},
doi = {10.1016/J.IPL.2017.12.010},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BringmannK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BuenoPPRRS18,
author = {Let{\'{\i}}cia Rodrigues Bueno and
Lucia Draque Penso and
F{\'{a}}bio Protti and
Victor R. Ramos and
Dieter Rautenbach and
U{\'{e}}verton S. Souza},
title = {On the hardness of finding the geodetic number of a subcubic graph},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {22--27},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.012},
doi = {10.1016/J.IPL.2018.02.012},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BuenoPPRRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CaiLZ18,
author = {Junqing Cai and
Hao Li and
Yuzhong Zhang},
title = {An implicit degree condition for \emph{k}-connected 2-heavy graphs
to be hamiltonian},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {9--13},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.010},
doi = {10.1016/J.IPL.2018.01.010},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CaiLZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CenciarelliGS18,
author = {Pietro Cenciarelli and
Daniele Gorla and
Ivano Salvo},
title = {Inefficiencies in network models: {A} graph-theoretic perspective},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {44--50},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.10.008},
doi = {10.1016/J.IPL.2017.10.008},
timestamp = {Thu, 25 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CenciarelliGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChanR18,
author = {Timothy M. Chan and
Zahed Rahmati},
title = {An improved approximation algorithm for the discrete Fr{\'{e}}chet
distance},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {72--74},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.011},
doi = {10.1016/J.IPL.2018.06.011},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChanR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangPHS18,
author = {Ku{-}Young Chang and
Sun{-}Mi Park and
Dowon Hong and
Changho Seo},
title = {Efficient multiplier based on hybrid approach for Toeplitz matrix-vector
product},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {33--38},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.006},
doi = {10.1016/J.IPL.2017.11.006},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChangPHS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChaplickFMR18,
author = {Steven Chaplick and
Maximilian F{\"{u}}rst and
Fr{\'{e}}d{\'{e}}ric Maffray and
Dieter Rautenbach},
title = {On some graphs with a unique perfect matching},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {60--63},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.07.008},
doi = {10.1016/J.IPL.2018.07.008},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChaplickFMR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen18,
author = {Po{-}An Chen},
title = {Generalized mirror descents with non-convex potential functions in
atomic congestion games: Continuous time and discrete time},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {36--39},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.10.003},
doi = {10.1016/J.IPL.2017.10.003},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Chen18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen18a,
author = {Jing Chen},
title = {The pessimistic diagnosability of Split-Star Networks under the {PMC}
model},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {80--82},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.008},
doi = {10.1016/J.IPL.2018.03.008},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenN18,
author = {Meirun Chen and
Reza Naserasr},
title = {The optimal routing of augmented cubes},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {59--63},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.003},
doi = {10.1016/J.IPL.2018.04.003},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenX18,
author = {Xiaoli Chen and
Weijun Xu},
title = {A risk-reward model with compound interest rate for non-additive two-option
ski rental},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {9--13},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.013},
doi = {10.1016/J.IPL.2018.02.013},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChungY18,
author = {Byungjin Chung and
Changhoon Yim},
title = {Fast intra prediction method by adaptive number of candidate modes
for {RDO} in {HEVC}},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {20--25},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.005},
doi = {10.1016/J.IPL.2017.11.005},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChungY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ClymoB18,
author = {Judith Clymo and
Olaf Beyersdorff},
title = {Relating size and width in variants of Q-resolution},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {1--6},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.005},
doi = {10.1016/J.IPL.2018.05.005},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ClymoB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CroitoruM18,
author = {Cosmina Croitoru and
Kurt Mehlhorn},
title = {On testing substitutability},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {19--21},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.006},
doi = {10.1016/J.IPL.2018.05.006},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CroitoruM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DabrowskiP18,
author = {Konrad K. Dabrowski and
Dani{\"{e}}l Paulusma},
title = {On colouring (2\emph{P}\({}_{\mbox{2}}\), \emph{H})-free and (\emph{P}\({}_{\mbox{5}}\),
\emph{H})-free graphs},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {35--41},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.003},
doi = {10.1016/J.IPL.2018.02.003},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DabrowskiP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasDER18,
author = {Bireswar Das and
Anirban Dasgupta and
Murali Krishna Enduri and
I. Vinod Reddy},
title = {On {NC} algorithms for problems on bounded rank-width graphs},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {64--67},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.07.007},
doi = {10.1016/J.IPL.2018.07.007},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DasDER18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Delgado-SeguraP18,
author = {Sergi Delgado{-}Segura and
Cristina P{\'{e}}rez{-}Sol{\`{a}} and
Jordi Herrera{-}Joancomart{\'{\i}} and
Guillermo Navarro{-}Arribas},
title = {Bitcoin private key locked transactions},
journal = {Inf. Process. Lett.},
volume = {140},
pages = {37--41},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.08.004},
doi = {10.1016/J.IPL.2018.08.004},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Delgado-SeguraP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Demba18,
author = {Moussa Demba},
title = {Equivalence checking of two functional programs using inductive theorem
provers},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {16--24},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.08.002},
doi = {10.1016/J.IPL.2017.08.002},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Demba18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DolguiKNQ18,
author = {Alexandre Dolgui and
Vladimir Kotov and
Aliaksandr Nekrashevich and
Alain Quilliot},
title = {General parametric scheme for the online uniform machine scheduling
problem with two different speeds},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {18--23},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.009},
doi = {10.1016/J.IPL.2018.01.009},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DolguiKNQ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ducoffe18,
author = {Guillaume Ducoffe},
title = {A short note on the complexity of computing strong pathbreadth},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {56--58},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.005},
doi = {10.1016/J.IPL.2018.01.005},
timestamp = {Mon, 19 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Ducoffe18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DwivediMSD18,
author = {Ashutosh Dhar Dwivedi and
Pawel Morawiecki and
Rajani Singh and
Shalini Dhar},
title = {Differential-linear and related key cryptanalysis of round-reduced
scream},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {5--8},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.010},
doi = {10.1016/J.IPL.2018.03.010},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DwivediMSD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DziembowskiKZ18,
author = {Stefan Dziembowski and
Tomasz Kazana and
Maciej Zdanowicz},
title = {Quasi chain rule for min-entropy},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {62--66},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.007},
doi = {10.1016/J.IPL.2018.02.007},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DziembowskiKZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EderH18,
author = {G{\"{u}}nther Eder and
Martin Held},
title = {Computing positively weighted straight skeletons of simple polygons
based on a bisector arrangement},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {28--32},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.001},
doi = {10.1016/J.IPL.2017.12.001},
timestamp = {Mon, 03 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/EderH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FanBD18,
author = {Rui Fan and
Mohammud Junaid Bocus and
Naim Dahnoun},
title = {A novel disparity transformation algorithm for road segmentation},
journal = {Inf. Process. Lett.},
volume = {140},
pages = {18--24},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.08.001},
doi = {10.1016/J.IPL.2018.08.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FanBD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FanG18,
author = {Hua Fan and
Wojciech M. Golab},
title = {Analyzing linearizability violations in the presence of read-modify-write
operations},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {57--60},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.004},
doi = {10.1016/J.IPL.2018.06.004},
timestamp = {Thu, 28 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FanG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FilhoOSC18,
author = {Madiel Conserva Filho and
Marcel Vin{\'{\i}}cius Medeiros Oliveira and
Augusto Sampaio and
Ana Cavalcanti},
title = {Compositional and local livelock analysis for {CSP}},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {21--25},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.011},
doi = {10.1016/J.IPL.2017.12.011},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FilhoOSC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Filtser18,
author = {Omrit Filtser},
title = {Universal approximate simplification under the discrete Fr{\'{e}}chet
distance},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {22--27},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.10.002},
doi = {10.1016/J.IPL.2017.10.002},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Filtser18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FiszmanM18,
author = {Shir Fiszman and
Gur Mosheiov},
title = {Minimizing total load on a proportionate flowshop with position-dependent
processing times and job-rejection},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {39--43},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.004},
doi = {10.1016/J.IPL.2017.12.004},
timestamp = {Tue, 16 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FiszmanM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FominLPSZ18,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Fahad Panolan and
Saket Saurabh and
Meirav Zehavi},
title = {Long directed (\emph{s}, \emph{t})-path: {FPT} algorithm},
journal = {Inf. Process. Lett.},
volume = {140},
pages = {8--12},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.018},
doi = {10.1016/J.IPL.2018.04.018},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FominLPSZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FosterCWZ18,
author = {Simon Foster and
Ana Cavalcanti and
Jim Woodcock and
Frank Zeyda},
title = {Unifying theories of time with generalised reactive processes},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {47--52},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.017},
doi = {10.1016/J.IPL.2018.02.017},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FosterCWZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FriezeP18,
author = {Alan M. Frieze and
Samantha Petti},
title = {Balanced allocation through random walk},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {39--43},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.010},
doi = {10.1016/J.IPL.2017.11.010},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FriezeP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FrohnG18,
author = {Florian Frohn and
J{\"{u}}rgen Giesl},
title = {Constant runtime complexity of term rewriting is semi-decidable},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {18--23},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.012},
doi = {10.1016/J.IPL.2018.06.012},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FrohnG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GandhiHKPS18,
author = {Rajiv Gandhi and
Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Manish Purohit and
Kanthi K. Sarpatwar},
title = {On maximum leaf trees and connections to connected maximum cut problems},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {31--34},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.06.002},
doi = {10.1016/J.IPL.2017.06.002},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GandhiHKPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GaoG18,
author = {Hang Gao and
Wenyu Gao},
title = {Maximum matching and kernelization of edge dominating set},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {21--24},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.019},
doi = {10.1016/J.IPL.2018.03.019},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GaoG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GaoWL18,
author = {Jian Gao and
Yongkang Wang and
Juan Li},
title = {Bounds on covering radius of linear codes with Chinese Euclidean distance
over the finite non chain ring F2+vF2},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {22--26},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.007},
doi = {10.1016/J.IPL.2018.05.007},
timestamp = {Mon, 07 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GaoWL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GelleI18,
author = {Kitti Gelle and
Szabolcs Iv{\'{a}}n},
title = {Recognizing Union-Find trees is NP-complete},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {7--14},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.003},
doi = {10.1016/J.IPL.2017.11.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GelleI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GeraultLMS18,
author = {David G{\'{e}}rault and
Pascal Lafourcade and
Marine Minier and
Christine Solnon},
title = {Revisiting {AES} related-key differential attacks with constraint
programming},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {24--29},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.07.001},
doi = {10.1016/J.IPL.2018.07.001},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GeraultLMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gillis18,
author = {Nicolas Gillis},
title = {Multiplicative updates for polynomial root finding},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {14--18},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.008},
doi = {10.1016/J.IPL.2017.11.008},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Gillis18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Giorgi18,
author = {Pascal Giorgi},
title = {A probabilistic algorithm for verifying polynomial middle product
in linear time},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {30--34},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.014},
doi = {10.1016/J.IPL.2018.06.014},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Giorgi18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Glabbeek18,
author = {Rob J. van Glabbeek},
title = {On the validity of encodings of the synchronous in the asynchronous
\emph{{\(\pi\)}}-calculus},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {17--25},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.015},
doi = {10.1016/J.IPL.2018.04.015},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Glabbeek18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Golumbic18,
author = {Martin Charles Golumbic},
title = {Total coloring of rooted path graphs},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {73--76},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.002},
doi = {10.1016/J.IPL.2018.03.002},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Golumbic18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Grandi18,
author = {Fabio Grandi},
title = {On the analysis of Bloom filters},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {35--39},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.004},
doi = {10.1016/J.IPL.2017.09.004},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Grandi18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuHL18,
author = {Mei{-}Mei Gu and
Rong{-}Xia Hao and
Jian{-}Bing Liu},
title = {The pessimistic diagnosability of data center networks},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {52--56},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.009},
doi = {10.1016/J.IPL.2018.02.009},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuHL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Haddad18,
author = {Serge Haddad},
title = {Memoryless determinacy of finite parity games: Another simple proof},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {19--21},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.012},
doi = {10.1016/J.IPL.2017.11.012},
timestamp = {Tue, 16 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Haddad18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HalacsyM18,
author = {Gergely Hal{\'{a}}csy and
Zolt{\'{a}}n {\'{A}}d{\'{a}}m Mann},
title = {Optimal energy-efficient placement of virtual machines with divisible
sizes},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {51--56},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.003},
doi = {10.1016/J.IPL.2018.06.003},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HalacsyM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Harada18,
author = {Masaaki Harada},
title = {New quantum codes constructed from some self-dual additive F4-codes},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {35--38},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.008},
doi = {10.1016/J.IPL.2018.05.008},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Harada18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoffmannKW18,
author = {Stefan Hoffmann and
Thomas Kampermann and
Egon Wanke},
title = {Minimizing the number of max-power users in ad-hoc wireless networks
with minimum node degree requirements},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {25--29},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.015},
doi = {10.1016/J.IPL.2018.03.015},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HoffmannKW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HrubesP18,
author = {Pavel Hrubes and
Pavel Pudl{\'{a}}k},
title = {A note on monotone real circuits},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {15--19},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.002},
doi = {10.1016/J.IPL.2017.11.002},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HrubesP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Huang18,
author = {Xing Huang},
title = {An implicit degree sum condition for cycles through specified vertices},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {40--43},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.006},
doi = {10.1016/J.IPL.2017.09.006},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Huang18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuberMSS18,
author = {Katharina T. Huber and
Vincent Moulton and
Marie{-}France Sagot and
Blerina Sinaimeri},
title = {Geometric medians in reconciliation spaces of phylogenetic trees},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {96--101},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.001},
doi = {10.1016/J.IPL.2018.04.001},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HuberMSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IkenmeyerM18,
author = {Christian Ikenmeyer and
Stefan Mengel},
title = {On the relative power of reduction notions in arithmetic circuit complexity},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {7--10},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.009},
doi = {10.1016/J.IPL.2017.09.009},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/IkenmeyerM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/InenagaH18,
author = {Shunsuke Inenaga and
Heikki Hyyr{\"{o}}},
title = {A hardness result and new algorithm for the longest common palindromic
subsequence problem},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {11--15},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.08.006},
doi = {10.1016/J.IPL.2017.08.006},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/InenagaH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jiang18,
author = {Minghui Jiang},
title = {Periodicity of identifying codes in strips},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {77--84},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.007},
doi = {10.1016/J.IPL.2018.03.007},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jiang18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JiangZ18,
author = {Ting Jiang and
Xiao Jian Zhou},
title = {Gradient/Hessian-enhanced least square support vector regression},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {1--8},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.014},
doi = {10.1016/J.IPL.2018.01.014},
timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JiangZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JobsonKL18,
author = {Adam S. Jobson and
Andr{\'{e}} E. K{\'{e}}zdy and
Jeno Lehel},
title = {Linkage on the infinite grid},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {51--56},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.001},
doi = {10.1016/J.IPL.2018.05.001},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JobsonKL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JonasS18,
author = {Martin Jon{\'{a}}s and
Jan Strejcek},
title = {On the complexity of the quantified bit-vector arithmetic with binary
encoding},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {57--61},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.018},
doi = {10.1016/J.IPL.2018.02.018},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JonasS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JouidaK18,
author = {Sihem Ben Jouida and
Saoussen Krichen},
title = {A {DSS} based on optimizer tools and {MTS} meta-heuristic for the
Warehousing Problem with Conflicts},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {14--21},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.001},
doi = {10.1016/J.IPL.2018.02.001},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JouidaK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KauersS18,
author = {Manuel Kauers and
Martina Seidl},
title = {Short proofs for some symmetric Quantified Boolean Formulas},
journal = {Inf. Process. Lett.},
volume = {140},
pages = {4--7},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.07.009},
doi = {10.1016/J.IPL.2018.07.009},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KauersS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KazemiMK18,
author = {Mohammad Reza Kazemi and
Ali Mohades and
Payam Khanteimouri},
title = {Approximation algorithms for color spanning diameter},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {53--56},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.007},
doi = {10.1016/J.IPL.2018.01.007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KazemiMK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KeszoczeSD18,
author = {Oliver Kesz{\"{o}}cze and
Mathias Soeken and
Rolf Drechsler},
title = {The complexity of error metrics},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {1--7},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.010},
doi = {10.1016/J.IPL.2018.06.010},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KeszoczeSD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KhoshkhahT18,
author = {Kaveh Khoshkhah and
Dirk Oliver Theis},
title = {Fooling sets and the Spanning Tree polytope},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {11--13},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.05.009},
doi = {10.1016/J.IPL.2017.05.009},
timestamp = {Tue, 16 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KhoshkhahT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KimLMP18,
author = {Minki Kim and
Bernard Lidick{\'{y}} and
Tom{\'{a}}s Masar{\'{\i}}k and
Florian Pfender},
title = {Notes on complexity of packing coloring},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {6--10},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.012},
doi = {10.1016/J.IPL.2018.04.012},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KimLMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KishoreVS18,
author = {Ravi Kishore and
Chiranjeevi Vanarasa and
Kannan Srinathan},
title = {On minimal connectivity requirements for secure message transmission
in directed networks},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {1--6},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.001},
doi = {10.1016/J.IPL.2017.11.001},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KishoreVS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kochol18,
author = {Martin Kochol},
title = {Three colorability characterized by shrinking of locally connected
subgraphs into triangles},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {33--35},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.016},
doi = {10.1016/J.IPL.2018.02.016},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kochol18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KormanPR18,
author = {Matias Korman and
Sheung{-}Hung Poon and
Marcel Roeloffzen},
title = {Line segment covering of cells in arrangements},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {25--30},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.002},
doi = {10.1016/J.IPL.2017.09.002},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KormanPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KosinskiMN18,
author = {Karol Kosinski and
Robert Mercas and
Dirk Nowotka},
title = {Corrigendum to "A note on Thue games" [Inf. Process. Lett. 118 {(2017)}
75-77]},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {63--65},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.10.004},
doi = {10.1016/J.IPL.2017.10.004},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KosinskiMN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kostolanyi18,
author = {Peter Kostol{\'{a}}nyi},
title = {On deterministic weighted automata},
journal = {Inf. Process. Lett.},
volume = {140},
pages = {42--47},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.08.005},
doi = {10.1016/J.IPL.2018.08.005},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kostolanyi18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KowalukL18,
author = {Miroslaw Kowaluk and
Andrzej Lingas},
title = {Are unique subgraphs not easier to find?},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {57--61},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.010},
doi = {10.1016/J.IPL.2018.02.010},
timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KowalukL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kundu18,
author = {Sukhamay Kundu},
title = {A generalized linear time algorithm for an optimal \emph{k}-distance
dominating set of a weighted tree},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {58--62},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.10.009},
doi = {10.1016/J.IPL.2017.10.009},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Kundu18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LaiLPQO18,
author = {Hong Lai and
Mingxing Luo and
Josef Pieprzyk and
Zhiguo Qu and
Mehmet A. Orgun},
title = {Efficient quantum key distribution using Fibonacci-number coding with
a biased basis choice},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {24--30},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.011},
doi = {10.1016/J.IPL.2018.01.011},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LaiLPQO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lauria18,
author = {Massimo Lauria},
title = {Cliques enumeration and tree-like resolution proofs},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {62--67},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.001},
doi = {10.1016/J.IPL.2018.03.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lauria18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lauria18a,
author = {Massimo Lauria},
title = {A note about \emph{k}-DNF resolution},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {33--39},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.014},
doi = {10.1016/J.IPL.2018.04.014},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lauria18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LauriaT18,
author = {Massimo Lauria and
Neil Thapen},
title = {On semantic cutting planes with very small coefficients},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {70--75},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.007},
doi = {10.1016/J.IPL.2018.04.007},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LauriaT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Leiva18,
author = {Luis A. Leiva},
title = {Responsive text summarization},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {52--57},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.10.007},
doi = {10.1016/J.IPL.2017.10.007},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Leiva18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LemireKR18,
author = {Daniel Lemire and
Nathan Kurz and
Christoph Rupp},
title = {Stream VByte: Faster byte-oriented integer compression},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {1--6},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.011},
doi = {10.1016/J.IPL.2017.09.011},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LemireKR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiLL18,
author = {Xiaomin Li and
Lan Lei and
Hong{-}Jian Lai},
title = {The connectivity of generalized graph products},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {37--40},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.014},
doi = {10.1016/J.IPL.2018.03.014},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiZSX18,
author = {Zepeng Li and
Enqiang Zhu and
Zehui Shao and
Jin Xu},
title = {NP-completeness of local colorings of graphs},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {25--29},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.013},
doi = {10.1016/J.IPL.2017.09.013},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiZSX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LichenLL18,
author = {Junran Lichen and
Jianping Li and
Ko{-}Wei Lih},
title = {Approximation algorithms for constructing specific subgraphs with
minimum number of length-bounded stock pieces},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {11--16},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.013},
doi = {10.1016/J.IPL.2018.04.013},
timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LichenLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinFWCFL18,
author = {Mugang Lin and
Qilong Feng and
Jianxin Wang and
Jianer Chen and
Bin Fu and
Wenjun Li},
title = {An improved {FPT} algorithm for Almost Forest Deletion problem},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {30--36},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.016},
doi = {10.1016/J.IPL.2018.03.016},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinFWCFL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinJL18,
author = {Shangwei Lin and
Ya'nan Jin and
Chunfang Li},
title = {Cartesian product digraphs with optimal restricted arc connectivity},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {72--75},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.014},
doi = {10.1016/J.IPL.2018.02.014},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinJL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinMV18,
author = {Min Chih Lin and
Juli{\'{a}}n Mestre and
Saveliy Vasiliev},
title = {Approximating weighted neighborhood independent sets},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {11--15},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.014},
doi = {10.1016/J.IPL.2017.09.014},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LinMV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuR18,
author = {Yunwen Liu and
Vincent Rijmen},
title = {New observations on invariant subspace attack},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {27--30},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.015},
doi = {10.1016/J.IPL.2018.01.015},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuWXS18,
author = {Kejing Lu and
Hongya Wang and
Yingyuan Xiao and
Hui Song},
title = {Why locality sensitive hashing works: {A} practical perspective},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {49--58},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.018},
doi = {10.1016/J.IPL.2018.03.018},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuWXS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LucasG18,
author = {Salvador Lucas and
Ra{\'{u}}l Guti{\'{e}}rrez},
title = {Use of logical models for proving infeasibility in term rewriting},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {90--95},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.002},
doi = {10.1016/J.IPL.2018.04.002},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LucasG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaY18,
author = {Fei Ma and
Bing Yao},
title = {The number of spanning trees of a class of self-similar fractal models},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {64--69},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.004},
doi = {10.1016/J.IPL.2018.04.004},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MaY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaiseliMKK18,
author = {Baraka Jacob Maiseli and
Hubert Msuya and
Suzan Kessy and
Michael Kisangiri},
title = {Perona-Malik model with self-adjusting shape-defining constant},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {26--32},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.016},
doi = {10.1016/J.IPL.2018.04.016},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MaiseliMKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ManethS18,
author = {Sebastian Maneth and
Helmut Seidl},
title = {Balancedness of {MSO} transductions in polynomial time},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {26--32},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.002},
doi = {10.1016/J.IPL.2018.01.002},
timestamp = {Mon, 19 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ManethS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MarcilonS18,
author = {Thiago Braga Marcilon and
Rudini Menezes Sampaio},
title = {The {P3} infection time is W[1]-hard parameterized by the treewidth},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {55--61},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.006},
doi = {10.1016/J.IPL.2017.12.006},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MarcilonS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Meir18,
author = {Or Meir},
title = {The direct sum of universal relations},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {105--111},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.009},
doi = {10.1016/J.IPL.2018.04.009},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Meir18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MeirT18,
author = {Or Meir and
Avishay Tal},
title = {The choice and agreement problems of a random function},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {16--20},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.007},
doi = {10.1016/J.IPL.2017.12.007},
timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MeirT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mollard18,
author = {Michel Mollard},
title = {The existence of perfect codes in a family of generalized Fibonacci
cubes},
journal = {Inf. Process. Lett.},
volume = {140},
pages = {1--3},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.07.010},
doi = {10.1016/J.IPL.2018.07.010},
timestamp = {Thu, 27 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mollard18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MorinagaHIU18,
author = {Atsushi Morinaga and
Kenji Hara and
Kohei Inoue and
Kiichi Urahama},
title = {Classification between natural and graphics images based on generalized
Gaussian distributions},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {31--34},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.010},
doi = {10.1016/J.IPL.2018.05.010},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MorinagaHIU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MoserS18,
author = {Philippe Moser and
Frank Stephan},
title = {Limit-depth and {DNR} degrees},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {36--40},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.015},
doi = {10.1016/J.IPL.2018.02.015},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MoserS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NiehuesCP18,
author = {Lucas Boppre Niehues and
Ricardo Felipe Cust{\'{o}}dio and
Daniel Panario},
title = {Fast modular reduction and squaring in \emph{GF}(2\({}^{\mbox{\emph{m}}}\))},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {33--38},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.002},
doi = {10.1016/J.IPL.2017.12.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NiehuesCP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nutov18,
author = {Zeev Nutov},
title = {Improved approximation algorithms for \emph{k}-connected \emph{m}-dominating
set problems},
journal = {Inf. Process. Lett.},
volume = {140},
pages = {30--33},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.08.003},
doi = {10.1016/J.IPL.2018.08.003},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Nutov18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PandayAL18,
author = {Deepak Panday and
Renato Cordeiro de Amorim and
Peter C. R. Lane},
title = {Feature weighting as a tool for unsupervised feature selection},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {44--52},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.005},
doi = {10.1016/J.IPL.2017.09.005},
timestamp = {Fri, 29 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PandayAL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PapadopoulosC18,
author = {Kleitos Papadopoulos and
Demetres Christofides},
title = {A fast algorithm for the gas station problem},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {55--59},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.009},
doi = {10.1016/J.IPL.2017.11.009},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PapadopoulosC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PeiPH18,
author = {Li{-}Dan Pei and
Xiang{-}Feng Pan and
Fu{-}Tao Hu},
title = {Some improved inequalities related to Vizing's conjecture},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {85--91},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.003},
doi = {10.1016/J.IPL.2018.03.003},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PeiPH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pelc18,
author = {Andrzej Pelc},
title = {Reaching a target in the plane with no information},
journal = {Inf. Process. Lett.},
volume = {140},
pages = {13--17},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.006},
doi = {10.1016/J.IPL.2018.04.006},
timestamp = {Thu, 27 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pelc18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Polak18,
author = {Adam Polak},
title = {Why is it hard to beat \emph{O}(\emph{n}\({}^{\mbox{2}}\)) for Longest
Common Weakly Increasing Subsequence?},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {1--5},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.007},
doi = {10.1016/J.IPL.2017.11.007},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Polak18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ReisM18,
author = {Jacinto F. S. Reis and
Alexandre Mota},
title = {Aiding exploratory testing with pruned {GUI} models},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {49--55},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.008},
doi = {10.1016/J.IPL.2018.01.008},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ReisM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rusu18,
author = {Irena Rusu},
title = {Sorting signed permutations by reversals using link-cut trees},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {44--48},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.005},
doi = {10.1016/J.IPL.2017.12.005},
timestamp = {Tue, 16 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Rusu18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SakharovS18,
author = {Alexander Sakharov and
Timothy Sakharov},
title = {The Viterbi algorithm for subsets of stochastic context-free languages},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {68--72},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.005},
doi = {10.1016/J.IPL.2018.03.005},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SakharovS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SattariI18,
author = {Sattar Sattari and
Mohammad Izadi},
title = {Upper bounds for minimum dilation triangulation in two special cases},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {33--38},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.001},
doi = {10.1016/J.IPL.2018.01.001},
timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SattariI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SeoP18,
author = {Jungjoo Seo and
Kunsoo Park},
title = {Fast batch modular exponentiation with common-multiplicand multiplication},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {5--10},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.003},
doi = {10.1016/J.IPL.2017.09.003},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SeoP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShenWF18,
author = {Lin{-}Zhi Shen and
Jiejing Wen and
Fang{-}Wei Fu},
title = {A new class of zero-difference balanced functions},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {9--11},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.011},
doi = {10.1016/J.IPL.2018.03.011},
timestamp = {Mon, 21 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShenWF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shitov18,
author = {Yaroslav Shitov},
title = {On the complexity of graph coloring with additional local conditions},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {92--94},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.009},
doi = {10.1016/J.IPL.2018.03.009},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shitov18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Shraibman18,
author = {Adi Shraibman},
title = {A note on multiparty communication complexity and the Hales-Jewett
theorem},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {44--48},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.07.002},
doi = {10.1016/J.IPL.2018.07.002},
timestamp = {Thu, 27 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Shraibman18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SmalT18,
author = {Alexander V. Smal and
Navid Talebanfard},
title = {Prediction from partial information and hindsight, an alternative
proof},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {102--104},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.011},
doi = {10.1016/J.IPL.2018.04.011},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SmalT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SoekenTMM18,
author = {Mathias Soeken and
Eleonora Testa and
Alan Mishchenko and
Giovanni De Micheli},
title = {Pairs of majority-decomposing functions},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {35--38},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.07.004},
doi = {10.1016/J.IPL.2018.07.004},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SoekenTMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/StokesW18,
author = {Jonathan Stokes and
Steven Weber},
title = {Common greedy wiring and rewiring heuristics do not guarantee maximum
assortative graphs of given degree},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {53--59},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.07.003},
doi = {10.1016/J.IPL.2018.07.003},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/StokesW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SunZ18,
author = {Zhiren Sun and
Sizhong Zhou},
title = {A generalization of orthogonal factorizations in digraphs},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {49--54},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.12.003},
doi = {10.1016/J.IPL.2017.12.003},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SunZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Suzuki18,
author = {Toshio Suzuki},
title = {Non-depth-first search against independent distributions on an {AND-OR}
tree},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {13--17},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.013},
doi = {10.1016/J.IPL.2018.06.013},
timestamp = {Thu, 27 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Suzuki18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TaLL18,
author = {Toan Thang Ta and
Cheng{-}Yao Lin and
Chin Lung Lu},
title = {Two-string consensus problem under non-overlapping inversion and transposition
distance},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {46--51},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.10.006},
doi = {10.1016/J.IPL.2017.10.006},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TaLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TanJ18,
author = {Xuehou Tan and
Bo Jiang},
title = {An improved algorithm for computing a shortest watchman route for
lines},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {51--54},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.011},
doi = {10.1016/J.IPL.2017.11.011},
timestamp = {Thu, 07 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TanJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TaxLSFA18,
author = {Niek Tax and
Xixi Lu and
Natalia Sidorova and
Dirk Fahland and
Wil M. P. van der Aalst},
title = {The imprecisions of precision measures in process mining},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {1--8},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.013},
doi = {10.1016/J.IPL.2018.01.013},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TaxLSFA18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Thomasian18,
author = {Alexander Thomasian},
title = {Vacationing server model for {M/G/1} queues for rebuild processing
in {RAID5} and threshold scheduling for readers and writers},
journal = {Inf. Process. Lett.},
volume = {135},
pages = {41--46},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.011},
doi = {10.1016/J.IPL.2018.02.011},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Thomasian18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur18,
author = {Dekel Tsur},
title = {Succinct data structures for nearest colored node in a tree},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {6--10},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.10.001},
doi = {10.1016/J.IPL.2017.10.001},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsur18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vagvolgyi18,
author = {S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
title = {Intersection of the reflexive transitive closures of two rewrite relations
induced by term rewriting systems},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {47--51},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.005},
doi = {10.1016/J.IPL.2018.02.005},
timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Vagvolgyi18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Vajnovszki18,
author = {Vincent Vajnovszki},
title = {The equidistribution of some length-three vincular patterns on \emph{S}\({}_{\mbox{\emph{n}}}\)(132)},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {40--45},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.10.005},
doi = {10.1016/J.IPL.2017.10.005},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Vajnovszki18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Venkatakrishnan18,
author = {Yanamandram B. Venkatakrishnan and
Balakrishna Krishnakumari},
title = {An improved upper bound of edge-vertex domination number of a tree},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {14--17},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.012},
doi = {10.1016/J.IPL.2018.01.012},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Venkatakrishnan18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ViardML18,
author = {Tiphaine Viard and
Cl{\'{e}}mence Magnien and
Matthieu Latapy},
title = {Enumerating maximal cliques in link streams with durations},
journal = {Inf. Process. Lett.},
volume = {133},
pages = {44--48},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.006},
doi = {10.1016/J.IPL.2018.01.006},
timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ViardML18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ViscontiSP18,
author = {Andrea Visconti and
Chiara Valentina Schiavo and
Ren{\'{e}} Peralta},
title = {Improved upper bounds for the expected circuit complexity of dense
systems of linear equations over {GF(2)}},
journal = {Inf. Process. Lett.},
volume = {137},
pages = {1--5},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.010},
doi = {10.1016/J.IPL.2018.04.010},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ViscontiSP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangWW18,
author = {Yiqiao Wang and
Ping Wang and
Weifan Wang},
title = {Strong chromatic index of \emph{K}\({}_{\mbox{4}}\)-minor free graphs},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {53--56},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.007},
doi = {10.1016/J.IPL.2017.09.007},
timestamp = {Mon, 27 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangZSXQ18,
author = {Qiang Wang and
Hao Zhang and
Jianfei Sun and
Hu Xiong and
Zhiguang Qin},
title = {Comments on "A secure anti-collusion data sharing scheme for dynamic
groups in the cloud"},
journal = {Inf. Process. Lett.},
volume = {140},
pages = {34--36},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.005},
doi = {10.1016/J.IPL.2018.04.005},
timestamp = {Thu, 27 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangZSXQ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuZ18,
author = {Chao Xu and
Qian Zhang},
title = {The shortest kinship description problem},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {61--66},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.06.005},
doi = {10.1016/J.IPL.2018.06.005},
timestamp = {Tue, 04 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XuZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YanZRC18,
author = {Jin Yan and
Shaohua Zhang and
Yanyan Ren and
Junqing Cai},
title = {Degree sum conditions on two disjoint cycles in graphs},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {7--11},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.004},
doi = {10.1016/J.IPL.2018.05.004},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YanZRC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangLZZ18,
author = {Mengduo Yang and
Fanzhang Li and
Li Zhang and
Zhao Zhang},
title = {Deep learning algorithm with visual impression},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {1--4},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.004},
doi = {10.1016/J.IPL.2018.03.004},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YangLZZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangLZZ18a,
author = {Mengduo Yang and
Fanzhang Li and
Li Zhang and
Zhao Zhang},
title = {Lie group impression for deep learning},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {12--16},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.006},
doi = {10.1016/J.IPL.2018.03.006},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangLZZ18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zhang18,
author = {Hailiang Zhang},
title = {On the largest matching roots of graphs with cut edges},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {41--43},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.002},
doi = {10.1016/J.IPL.2018.02.002},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zhang18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangLJS18,
author = {Xiujun Zhang and
Zepeng Li and
Huiqin Jiang and
Zehui Shao},
title = {Double Roman domination in trees},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {31--34},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.01.004},
doi = {10.1016/J.IPL.2018.01.004},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangLJS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangLLZ18,
author = {Xin Zhang and
Jingfen Lan and
Bi Li and
Qiang Zhu},
title = {Light paths and edges in families of outer-1-planar graphs},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {83--89},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.04.008},
doi = {10.1016/J.IPL.2018.04.008},
timestamp = {Fri, 12 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangLLZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangZ18,
author = {Yuzhuo Zhang and
Xia Zhang},
title = {On \emph{f}-colorings of nearly bipartite graphs},
journal = {Inf. Process. Lett.},
volume = {134},
pages = {67--71},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.02.004},
doi = {10.1016/J.IPL.2018.02.004},
timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhiCC18,
author = {Ruicong Zhi and
Lianyu Cao and
Gang Cao},
title = {Translation and scale invariants of Krawtchouk moments},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {30--35},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.010},
doi = {10.1016/J.IPL.2017.09.010},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhiCC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhouY18,
author = {Yanwei Zhou and
Bo Yang},
title = {Leakage-resilient CCA2-secure certificateless public-key encryption
scheme without bilinear pairing},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {16--24},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.012},
doi = {10.1016/J.IPL.2017.09.012},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhouY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuD18,
author = {Chuangying Zhu and
Junping Du},
title = {Background feature clustering and its application to social text},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {44--48},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.017},
doi = {10.1016/J.IPL.2018.03.017},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhuD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuL18,
author = {Chun Jiang Zhu and
Kam{-}yiu Lam},
title = {Deterministic improved round-trip spanners},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {57--60},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.008},
doi = {10.1016/J.IPL.2017.09.008},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhuL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuS18,
author = {Enqiang Zhu and
Zehui Shao},
title = {Extremal problems on weak Roman domination number},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {12--18},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.009},
doi = {10.1016/J.IPL.2018.05.009},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhuS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zunic18,
author = {Anastazia Zunic},
title = {Shape diameter for object analysis},
journal = {Inf. Process. Lett.},
volume = {136},
pages = {76--79},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.03.012},
doi = {10.1016/J.IPL.2018.03.012},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Zunic18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AichholzerHKKLP17,
author = {Oswin Aichholzer and
Thomas Hackl and
Matias Korman and
Marc J. van Kreveld and
Maarten L{\"{o}}ffler and
Alexander Pilz and
Bettina Speckmann and
Emo Welzl},
title = {Packing plane spanning trees and paths in complete geometric graphs},
journal = {Inf. Process. Lett.},
volume = {124},
pages = {35--41},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.006},
doi = {10.1016/J.IPL.2017.04.006},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AichholzerHKKLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Al-SsulamiM17,
author = {Abdulrakeeb M. Al{-}Ssulami and
Hassan Mathkour},
title = {Faster string matching based on hashing and bit-parallelism},
journal = {Inf. Process. Lett.},
volume = {123},
pages = {51--55},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.03.005},
doi = {10.1016/J.IPL.2017.03.005},
timestamp = {Tue, 09 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Al-SsulamiM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AleksandrowiczA17,
author = {Gadi Aleksandrowicz and
Andrei Asinowski and
Gill Barequet and
Ronnie Barequet},
title = {Recovering highly-complex linear recurrences of integer sequences},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {62--66},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.006},
doi = {10.1016/J.IPL.2017.07.006},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AleksandrowiczA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AllemH17,
author = {Luiz Emilio Allem and
Carlos Hoppen},
title = {A pre-test for factoring bivariate polynomials with coefficients in
F\({}_{\mbox{2}}\)},
journal = {Inf. Process. Lett.},
volume = {121},
pages = {22--28},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.009},
doi = {10.1016/J.IPL.2017.01.009},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AllemH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AmirIR17,
author = {Amihood Amir and
Costas S. Iliopoulos and
Jakub Radoszewski},
title = {Two strings at Hamming distance 1 cannot be both quasiperiodic},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {54--57},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.08.005},
doi = {10.1016/J.IPL.2017.08.005},
timestamp = {Mon, 16 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AmirIR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Angelini17,
author = {Patrizio Angelini},
title = {Monotone drawings of graphs with few directions},
journal = {Inf. Process. Lett.},
volume = {120},
pages = {16--22},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.12.004},
doi = {10.1016/J.IPL.2016.12.004},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Angelini17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Attie17,
author = {Paul C. Attie},
title = {Finite-state concurrent programs can be expressed succinctly in triple
normal form},
journal = {Inf. Process. Lett.},
volume = {123},
pages = {8--13},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.02.004},
doi = {10.1016/J.IPL.2017.02.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Attie17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Baba17,
author = {Kensuke Baba},
title = {An acceleration of FFT-based algorithms for the match-count problem},
journal = {Inf. Process. Lett.},
volume = {125},
pages = {1--4},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.013},
doi = {10.1016/J.IPL.2017.04.013},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Baba17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BakhsheshF17,
author = {Davood Bakhshesh and
Mohammad Farshi},
title = {Angle-constrained spanners with angle at least {\(\pi\)}/3},
journal = {Inf. Process. Lett.},
volume = {120},
pages = {44--46},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.002},
doi = {10.1016/J.IPL.2017.01.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BakhsheshF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BanerjeeBBBDMR17,
author = {Sandip Banerjee and
Bhargab B. Bhattacharya and
Binay Bhattacharya and
Arindam Biswas and
Sandip Das and
Ritankar Mandal and
Sasanka Roy},
title = {On representing a simple polygon perceivable to a blind person},
journal = {Inf. Process. Lett.},
volume = {120},
pages = {1--5},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.11.006},
doi = {10.1016/J.IPL.2016.11.006},
timestamp = {Mon, 13 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BanerjeeBBBDMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BansalU17,
author = {Nikhil Bansal and
Seeun William Umboh},
title = {Tight approximation bounds for dominating set on graphs of bounded
arboricity},
journal = {Inf. Process. Lett.},
volume = {122},
pages = {21--24},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.011},
doi = {10.1016/J.IPL.2017.01.011},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BansalU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BaoLYL17,
author = {Xiaoguang Bao and
Zhaohui Liu and
Wei Yu and
Ganggang Li},
title = {A note on approximation algorithms of the clustered traveling salesman
problem},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {54--57},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.003},
doi = {10.1016/J.IPL.2017.07.003},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BaoLYL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BasteBKS17,
author = {Julien Baste and
Fairouz Beggas and
Hamamache Kheddouci and
Ignasi Sau},
title = {On the parameterized complexity of the Edge Monitoring problem},
journal = {Inf. Process. Lett.},
volume = {121},
pages = {39--44},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.008},
doi = {10.1016/J.IPL.2017.01.008},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BasteBKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BercziB17,
author = {Krist{\'{o}}f B{\'{e}}rczi and
Erika R. B{\'{e}}rczi{-}Kov{\'{a}}cs},
title = {Directed hypergraphs and Horn minimization},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {32--37},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.013},
doi = {10.1016/J.IPL.2017.07.013},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BercziB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bernath17,
author = {Attila Bern{\'{a}}th},
title = {Covering symmetric supermodular functions with graph edges: {A} short
proof of a theorem of Bencz{\'{u}}r and Frank},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {49--53},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.08.003},
doi = {10.1016/J.IPL.2017.08.003},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Bernath17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BjorklundHL17,
author = {Andreas Bj{\"{o}}rklund and
Thore Husfeldt and
Isak Lyckberg},
title = {Computing the permanent modulo a prime power},
journal = {Inf. Process. Lett.},
volume = {125},
pages = {20--25},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.015},
doi = {10.1016/J.IPL.2017.04.015},
timestamp = {Fri, 09 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BjorklundHL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoyaciES17,
author = {Arman Boyaci and
T{\'{\i}}naz Ekim and
Mordechai Shalom},
title = {A polynomial-time algorithm for the maximum cardinality cut problem
in proper interval graphs},
journal = {Inf. Process. Lett.},
volume = {121},
pages = {29--33},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.007},
doi = {10.1016/J.IPL.2017.01.007},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BoyaciES17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Brand17,
author = {Michael Brand},
title = {Small polyomino packing},
journal = {Inf. Process. Lett.},
volume = {126},
pages = {30--34},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.004},
doi = {10.1016/J.IPL.2017.06.004},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Brand17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BresarH17,
author = {Bostjan Bresar and
Michael A. Henning},
title = {The game total domination problem is log-complete in {PSPACE}},
journal = {Inf. Process. Lett.},
volume = {126},
pages = {12--17},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.05.007},
doi = {10.1016/J.IPL.2017.05.007},
timestamp = {Tue, 11 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BresarH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BroelemannJMC17,
author = {Klaus Broelemann and
Xiaoyi Jiang and
Sudipto Mukherjee and
Ananda S. Chowdhury},
title = {Variants of k-regular nearest neighbor graph and their construction},
journal = {Inf. Process. Lett.},
volume = {126},
pages = {18--23},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.001},
doi = {10.1016/J.IPL.2017.06.001},
timestamp = {Wed, 31 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BroelemannJMC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BroereS17,
author = {Izak Broere and
Gabriel Semanisin},
title = {Some bounds on the generalised total chromatic number of degenerate
graphs},
journal = {Inf. Process. Lett.},
volume = {122},
pages = {30--33},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.02.008},
doi = {10.1016/J.IPL.2017.02.008},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BroereS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BruggenCDH17,
author = {Georg von der Br{\"{u}}ggen and
Jian{-}Jia Chen and
Robert I. Davis and
Wen{-}Hung Huang},
title = {Exact speedup factors for linear-time schedulability tests for fixed-priority
preemptive and non-preemptive scheduling},
journal = {Inf. Process. Lett.},
volume = {117},
pages = {1--5},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.08.001},
doi = {10.1016/J.IPL.2016.08.001},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BruggenCDH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangY17,
author = {Yi{-}Jun Chang and
Hsu{-}Chun Yen},
title = {Area-universal drawings of biconnected outerplane graphs},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {1--5},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.003},
doi = {10.1016/J.IPL.2016.09.003},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChatterjeeO17,
author = {Krishnendu Chatterjee and
Georg Osang},
title = {Pushdown reachability with constant treewidth},
journal = {Inf. Process. Lett.},
volume = {122},
pages = {25--29},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.02.003},
doi = {10.1016/J.IPL.2017.02.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChatterjeeO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChaturvediM17,
author = {Mmanu Chaturvedi and
Ross M. McConnell},
title = {A note on finding minimum mean cycle},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {21--22},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.007},
doi = {10.1016/J.IPL.2017.06.007},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChaturvediM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChehreghaniA17,
author = {Mostafa Haghir Chehreghani and
Talel Abdessalem},
title = {Upper and lower bounds for the q-entropy of network models with application
to network model selection},
journal = {Inf. Process. Lett.},
volume = {119},
pages = {1--8},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.11.002},
doi = {10.1016/J.IPL.2016.11.002},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChehreghaniA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen17,
author = {Zhe Chen},
title = {Parametric runtime verification is NP-complete and coNP-complete},
journal = {Inf. Process. Lett.},
volume = {123},
pages = {14--20},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.02.006},
doi = {10.1016/J.IPL.2017.02.006},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Chen17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenZWP17,
author = {Hon{-}Chan Chen and
Yun{-}Hao Zou and
Yue{-}Li Wang and
Kung{-}Jui Pai},
title = {A note on path embedding in crossed cubes with faulty vertices},
journal = {Inf. Process. Lett.},
volume = {121},
pages = {34--38},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.006},
doi = {10.1016/J.IPL.2017.01.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenZWP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DabrowskiP17,
author = {Konrad K. Dabrowski and
Dani{\"{e}}l Paulusma},
title = {Contracting bipartite graphs to paths and cycles},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {37--42},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.013},
doi = {10.1016/J.IPL.2017.06.013},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DabrowskiP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Damaschke17,
author = {Peter Damaschke},
title = {Refined algorithms for hitting many intervals},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {117--122},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.11.001},
doi = {10.1016/J.IPL.2016.11.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Damaschke17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DemaineGKLLMNSW17,
author = {Erik D. Demaine and
Varun Ganesan and
Vladislav Kontsevoi and
Qipeng Liu and
Quanquan C. Liu and
Fermi Ma and
Ofir Nachum and
Aaron Sidford and
Erik Waingarten and
Daniel Ziegler},
title = {Arboral satisfaction: Recognition and {LP} approximation},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {1--5},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.012},
doi = {10.1016/J.IPL.2017.04.012},
timestamp = {Thu, 13 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DemaineGKLLMNSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Diaz-BanezMPV17,
author = {Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
Ruy Fabila Monroy and
Pablo P{\'{e}}rez{-}Lantero and
Inmaculada Ventura},
title = {New results on the coarseness of bicolored point sets},
journal = {Inf. Process. Lett.},
volume = {123},
pages = {1--7},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.02.007},
doi = {10.1016/J.IPL.2017.02.007},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Diaz-BanezMPV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ee17,
author = {Martijn van Ee},
title = {Some notes on bounded starwidth graphs},
journal = {Inf. Process. Lett.},
volume = {125},
pages = {9--14},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.011},
doi = {10.1016/J.IPL.2017.04.011},
timestamp = {Fri, 09 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ee17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ehlers17,
author = {Thorsten Ehlers},
title = {Merging almost sorted sequences yields a 24-sorter},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {17--20},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.08.005},
doi = {10.1016/J.IPL.2016.08.005},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Ehlers17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ElbassioniN17,
author = {Khaled M. Elbassioni and
Trung Thanh Nguyen},
title = {A polynomial-time algorithm for computing low CP-rank decompositions},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {10--14},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.004},
doi = {10.1016/J.IPL.2016.09.004},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ElbassioniN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EsinerD17,
author = {Ertem Esiner and
Anwitaman Datta},
title = {On query result integrity over encrypted data},
journal = {Inf. Process. Lett.},
volume = {122},
pages = {34--39},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.02.005},
doi = {10.1016/J.IPL.2017.02.005},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EsinerD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fernandez-Campusano17,
author = {Christian Fern{\'{a}}ndez{-}Campusano and
Mikel Larrea and
Roberto Corti{\~{n}}as and
Michel Raynal},
title = {A distributed leader election algorithm in crash-recovery and omissive
systems},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {100--104},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.10.007},
doi = {10.1016/J.IPL.2016.10.007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fernandez-Campusano17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FolwarcznyK17,
author = {Luk\'a\v{s} Folwarczn\'y and
Dusan Knop},
title = {IV-matching is strongly NP-hard},
journal = {Inf. Process. Lett.},
volume = {125},
pages = {5--8},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.014},
doi = {10.1016/J.IPL.2017.04.014},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FolwarcznyK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FriezeA17,
author = {Alan M. Frieze and
Michael Anastos},
title = {Randomly coloring simple hypergraphs with fewer colors},
journal = {Inf. Process. Lett.},
volume = {126},
pages = {39--42},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.005},
doi = {10.1016/J.IPL.2017.06.005},
timestamp = {Tue, 11 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FriezeA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GadducciS17,
author = {Fabio Gadducci and
Francesco Santini},
title = {Residuation for bipolar preferences in soft constraints},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {69--74},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.10.002},
doi = {10.1016/J.IPL.2016.10.002},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GadducciS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GamardRSS17,
author = {Guilhem Gamard and
Gw{\'{e}}na{\"{e}}l Richomme and
Jeffrey O. Shallit and
Taylor J. Smith},
title = {Periodicity in rectangular arrays},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {58--63},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.011},
doi = {10.1016/J.IPL.2016.09.011},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GamardRSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GangopadhyayPSD17,
author = {Sugata Gangopadhyay and
Enes Pasalic and
Pantelimon Stanica and
Saral Datta},
title = {A note on non-splitting Z-bent functions},
journal = {Inf. Process. Lett.},
volume = {121},
pages = {1--5},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.001},
doi = {10.1016/J.IPL.2017.01.001},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GangopadhyayPSD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GaubertQ17,
author = {St{\'{e}}phane Gaubert and
Zheng Qu},
title = {Checking strict positivity of Kraus maps is NP-hard},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {35--43},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.008},
doi = {10.1016/J.IPL.2016.09.008},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GaubertQ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gavril17,
author = {Fanica Gavril},
title = {New insights on {GA-H} reduced graphs},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {58--61},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.08.007},
doi = {10.1016/J.IPL.2017.08.007},
timestamp = {Mon, 16 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gavril17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GiudiciHRT17,
author = {Alberto Giudici and
Pascal Halffmann and
Stefan Ruzika and
Clemens Thielen},
title = {Approximation schemes for the parametric knapsack problem},
journal = {Inf. Process. Lett.},
volume = {120},
pages = {11--15},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.12.003},
doi = {10.1016/J.IPL.2016.12.003},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GiudiciHRT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrinbergP17,
author = {Yuri Grinberg and
Theodore J. Perkins},
title = {Fully polynomial-time computation of maximum likelihood trajectories
in Markov chains},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {53--57},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.012},
doi = {10.1016/J.IPL.2016.09.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrinbergP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Han17,
author = {Yijie Han},
title = {Construct a perfect word hash function in time independent of the
size of integers},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {5--10},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.004},
doi = {10.1016/J.IPL.2017.07.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Han17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HanPP17,
author = {Yong{-}Jin Han and
Seong{-}Bae Park and
Se{-}Young Park},
title = {Personalized app recommendation using spatio-temporal app usage log},
journal = {Inf. Process. Lett.},
volume = {124},
pages = {15--20},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.004},
doi = {10.1016/J.IPL.2017.04.004},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HanPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HeL17,
author = {Cheng He and
Hao Lin},
title = {Notes on a hierarchical scheduling problem on identical machines},
journal = {Inf. Process. Lett.},
volume = {120},
pages = {6--10},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.12.001},
doi = {10.1016/J.IPL.2016.12.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HeL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HeamHK17,
author = {Pierre{-}Cyrille H{\'{e}}am and
Vincent Hugot and
Olga Kouchnarenko},
title = {The emptiness problem for tree automata with at least one global disequality
constraint is NP-hard},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {6--9},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.007},
doi = {10.1016/J.IPL.2016.09.007},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HeamHK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HolzhauserK17,
author = {Michael Holzhauser and
Sven O. Krumke},
title = {An {FPTAS} for the parametric knapsack problem},
journal = {Inf. Process. Lett.},
volume = {126},
pages = {43--47},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.006},
doi = {10.1016/J.IPL.2017.06.006},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HolzhauserK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HolzhauserKT17,
author = {Michael Holzhauser and
Sven O. Krumke and
Clemens Thielen},
title = {On the complexity and approximability of budget-constrained minimum
cost flows},
journal = {Inf. Process. Lett.},
volume = {126},
pages = {24--29},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.003},
doi = {10.1016/J.IPL.2017.06.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HolzhauserKT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ibarra17,
author = {Louis Ibarra},
title = {Computing the clique-separator graph for an interval graph in linear
time},
journal = {Inf. Process. Lett.},
volume = {124},
pages = {21--25},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.007},
doi = {10.1016/J.IPL.2017.04.007},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Ibarra17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JoerisLMO17,
author = {Benson L. Joeris and
Nathan Lindzey and
Ross M. McConnell and
Nissa Osheim},
title = {Simple {DFS} on the complement of a graph and on partially complemented
digraphs},
journal = {Inf. Process. Lett.},
volume = {117},
pages = {35--39},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.08.006},
doi = {10.1016/J.IPL.2016.08.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JoerisLMO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KawamuraTUY17,
author = {Akitoshi Kawamura and
Yuichi Tatsu and
Yushi Uno and
Masahide Yamato},
title = {Morpion Solitaire 5D: {A} new upper bound of 121 on the maximum score},
journal = {Inf. Process. Lett.},
volume = {121},
pages = {6--10},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.003},
doi = {10.1016/J.IPL.2017.01.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KawamuraTUY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KhazaeiA17,
author = {Shahram Khazaei and
Siavash Ahmadi},
title = {Ciphertext-only attack on d {\texttimes} d Hill in O(d13\({}^{\mbox{d}}\))},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {25--29},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.006},
doi = {10.1016/J.IPL.2016.09.006},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KhazaeiA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kokosinski17,
author = {Zbigniew Kokosinski},
title = {On generation of permutations of m out of n items},
journal = {Inf. Process. Lett.},
volume = {124},
pages = {1--5},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.001},
doi = {10.1016/J.IPL.2017.04.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kokosinski17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kosolobov17,
author = {Dmitry Kosolobov},
title = {Tight lower bounds for the longest common extension problem},
journal = {Inf. Process. Lett.},
volume = {125},
pages = {26--29},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.05.003},
doi = {10.1016/J.IPL.2017.05.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Kosolobov17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kundu17,
author = {Abhisek Kundu},
title = {Relaxed leverage sampling for low-rank matrix completion},
journal = {Inf. Process. Lett.},
volume = {124},
pages = {6--9},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.002},
doi = {10.1016/J.IPL.2017.04.002},
timestamp = {Fri, 09 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kundu17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KwonC17,
author = {Shinil Kwon and
Sung Deok Cha},
title = {CAPTCHA-based image annotation},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {27--31},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.009},
doi = {10.1016/J.IPL.2017.07.009},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KwonC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lasota17,
author = {Slawomir Lasota},
title = {Equivariant algorithms for constraint satisfaction problems over coset
templates},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {44--52},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.009},
doi = {10.1016/J.IPL.2016.09.009},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Lasota17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lee17,
author = {Euiwoong Lee},
title = {APX-hardness of maximizing Nash social welfare with indivisible items},
journal = {Inf. Process. Lett.},
volume = {122},
pages = {17--20},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.012},
doi = {10.1016/J.IPL.2017.01.012},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Lee17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeCC17,
author = {Ming{-}Che Lee and
Sheng Yu Chiu and
Jia{-}Wei Chang},
title = {A Deep Convolutional Neural Network based Chinese Menu Recognition
App},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {14--20},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.010},
doi = {10.1016/J.IPL.2017.07.010},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LeeCC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeSW17,
author = {Euiwoong Lee and
Melanie Schmidt and
John Wright},
title = {Improved and simplified inapproximability for k-means},
journal = {Inf. Process. Lett.},
volume = {120},
pages = {40--43},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.11.009},
doi = {10.1016/J.IPL.2016.11.009},
timestamp = {Thu, 11 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Leitert17,
author = {Arne Leitert},
title = {3-colouring for dually chordal graphs and generalisations},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {21--26},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.012},
doi = {10.1016/J.IPL.2017.07.012},
timestamp = {Mon, 16 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Leitert17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lev-AriBKS17,
author = {Kfir Lev{-}Ari and
Edward Bortnikov and
Idit Keidar and
Alexander Shraer},
title = {Composing ordered sequential consistency},
journal = {Inf. Process. Lett.},
volume = {123},
pages = {47--50},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.03.004},
doi = {10.1016/J.IPL.2017.03.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Lev-AriBKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiL17,
author = {Min Li and
Q. Liu},
title = {Inexact feasibility pump for mixed integer nonlinear programming},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {110--116},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.10.009},
doi = {10.1016/J.IPL.2016.10.009},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiQLZR17,
author = {Kai Li and
Daowen Qiu and
Lvzhou Li and
Shenggen Zheng and
Zhenbang Rong},
title = {Application of distributed semi-quantum computing model in phase estimation},
journal = {Inf. Process. Lett.},
volume = {120},
pages = {23--29},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.12.002},
doi = {10.1016/J.IPL.2016.12.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiQLZR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiX17,
author = {Zepeng Li and
Jin Xu},
title = {A characterization of trees with equal independent domination and
secure domination numbers},
journal = {Inf. Process. Lett.},
volume = {119},
pages = {14--18},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.11.004},
doi = {10.1016/J.IPL.2016.11.004},
timestamp = {Fri, 17 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiangSK17,
author = {Zuosong Liang and
Erfang Shan and
Liying Kang},
title = {The clique-transversal set problem in \{claw, K\({}_{\mbox{4}}\)\}-free
planar graphs},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {64--68},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.10.001},
doi = {10.1016/J.IPL.2016.10.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiangSK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LimaRSS17,
author = {Carlos Vin{\'{\i}}cius G. C. Lima and
Dieter Rautenbach and
U{\'{e}}verton S. Souza and
Jayme Luiz Szwarcfiter},
title = {Decycling with a matching},
journal = {Inf. Process. Lett.},
volume = {124},
pages = {26--29},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.003},
doi = {10.1016/J.IPL.2017.04.003},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LimaRSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinC17,
author = {Min{-}Sheng Lin and
Chien{-}Min Chen},
title = {Linear-time algorithms for counting independent sets in bipartite
permutation graphs},
journal = {Inf. Process. Lett.},
volume = {122},
pages = {1--7},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.02.002},
doi = {10.1016/J.IPL.2017.02.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuFXH17,
author = {Yong{-}Jin Liu and
Dian Fan and
Chunxu Xu and
Ying He},
title = {Space complexity of exact discrete geodesic algorithms on regular
triangulations},
journal = {Inf. Process. Lett.},
volume = {124},
pages = {10--14},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.005},
doi = {10.1016/J.IPL.2017.04.005},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuFXH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LouzaGT17,
author = {Felipe A. Louza and
Simon Gog and
Guilherme P. Telles},
title = {Optimal suffix sorting and {LCP} array construction for constant alphabets},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {30--34},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.010},
doi = {10.1016/J.IPL.2016.09.010},
timestamp = {Fri, 10 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LouzaGT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Magdon-Ismail17,
author = {Malik Magdon{-}Ismail},
title = {NP-hardness and inapproximability of sparse {PCA}},
journal = {Inf. Process. Lett.},
volume = {126},
pages = {35--38},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.05.008},
doi = {10.1016/J.IPL.2017.05.008},
timestamp = {Tue, 11 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Magdon-Ismail17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ManciniMMMST17,
author = {Toni Mancini and
Federico Mari and
Annalisa Massini and
Igor Melatti and
Ivano Salvo and
Enrico Tronci},
title = {On minimising the maximum expected verification time},
journal = {Inf. Process. Lett.},
volume = {122},
pages = {8--16},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.02.001},
doi = {10.1016/J.IPL.2017.02.001},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ManciniMMMST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mashhadi17,
author = {Samaneh Mashhadi},
title = {New multi-stage secret sharing in the standard model},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {43--48},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.002},
doi = {10.1016/J.IPL.2017.07.002},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mashhadi17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MencPU17,
author = {Artur Menc and
Dominik Pajak and
Przemyslaw Uznanski},
title = {Time and space optimality of rotor-router graph exploration},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {17--20},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.010},
doi = {10.1016/J.IPL.2017.06.010},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MencPU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MercasN17,
author = {Robert Mercas and
Dirk Nowotka},
title = {A note on Thue games},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {75--77},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.10.004},
doi = {10.1016/J.IPL.2016.10.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MercasN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MoultonOW17,
author = {Vincent Moulton and
James Oldman and
Taoyang Wu},
title = {A cubic-time algorithm for computing the trinet distance between level-1
networks},
journal = {Inf. Process. Lett.},
volume = {123},
pages = {36--41},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.03.002},
doi = {10.1016/J.IPL.2017.03.002},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MoultonOW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NakprasitN17,
author = {Keaitsuda Maneeruk Nakprasit and
Kittikorn Nakprasit},
title = {The strong equitable vertex 2-arboricity of complete bipartite and
tripartite graphs},
journal = {Inf. Process. Lett.},
volume = {117},
pages = {40--44},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.08.007},
doi = {10.1016/J.IPL.2016.08.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NakprasitN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NandyPR17,
author = {Subhas C. Nandy and
Supantha Pandit and
Sasanka Roy},
title = {Faster approximation for maximum independent set on unit disk graph},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {58--61},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.007},
doi = {10.1016/J.IPL.2017.07.007},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NandyPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Nederlof17,
author = {Jesper Nederlof},
title = {A short note on Merlin-Arthur protocols for subset sum},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {15--16},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.002},
doi = {10.1016/J.IPL.2016.09.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Nederlof17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NicolaeR17,
author = {Marius Nicolae and
Sanguthevar Rajasekaran},
title = {On pattern matching with k mismatches and few don't cares},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {78--82},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.10.003},
doi = {10.1016/J.IPL.2016.10.003},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NicolaeR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ochem17,
author = {Pascal Ochem},
title = {2-subcoloring is NP-complete for planar comparability graphs},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {46--48},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.08.004},
doi = {10.1016/J.IPL.2017.08.004},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Ochem17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OchemM17,
author = {Pascal Ochem and
Nazanin Movarraei},
title = {Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms},
journal = {Inf. Process. Lett.},
volume = {123},
pages = {42--46},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.02.009},
doi = {10.1016/J.IPL.2017.02.009},
timestamp = {Tue, 09 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OchemM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PengPNTY17,
author = {Weiguang Peng and
NingNing Peng and
Keng Meng Ng and
Kazuyuki Tanaka and
Yue Yang},
title = {Optimal depth-first algorithms and equilibria of independent distributions
on multi-branching trees},
journal = {Inf. Process. Lett.},
volume = {125},
pages = {41--45},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.05.002},
doi = {10.1016/J.IPL.2017.05.002},
timestamp = {Sat, 27 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PengPNTY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Perez17,
author = {Guillermo A. P{\'{e}}rez},
title = {The fixed initial credit problem for partial-observation energy games
is Ack-complete},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {91--99},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.10.005},
doi = {10.1016/J.IPL.2016.10.005},
timestamp = {Thu, 08 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Perez17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PontiR17,
author = {Moacir Ponti and
Mateus Riva},
title = {An incremental linear-time learning algorithm for the Optimum-Path
Forest classifier},
journal = {Inf. Process. Lett.},
volume = {126},
pages = {1--6},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.05.004},
doi = {10.1016/J.IPL.2017.05.004},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PontiR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Qi17,
author = {Hao Qi},
title = {Bounds on partial online list colouring},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {23--26},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.009},
doi = {10.1016/J.IPL.2017.06.009},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Qi17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RadonjicV17,
author = {Aleksandar Radonjic and
Vladimir Vujicic},
title = {Integer codes correcting single errors and burst asymmetric errors
within a byte},
journal = {Inf. Process. Lett.},
volume = {121},
pages = {45--50},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.010},
doi = {10.1016/J.IPL.2017.01.010},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RadonjicV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rial17,
author = {Alfredo Rial},
title = {Issuer-free oblivious transfer with access control revisited},
journal = {Inf. Process. Lett.},
volume = {126},
pages = {7--11},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.05.006},
doi = {10.1016/J.IPL.2017.05.006},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Rial17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RodriguesX17,
author = {F{\'{e}}lix Carvalho Rodrigues and
Eduardo Candido Xavier},
title = {Non-cooperative capacitated facility location games},
journal = {Inf. Process. Lett.},
volume = {117},
pages = {45--53},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.001},
doi = {10.1016/J.IPL.2016.09.001},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RodriguesX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Rudow17,
author = {Michael Rudow},
title = {Discrete Logarithm and Minimum Circuit Size},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {1--4},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.005},
doi = {10.1016/J.IPL.2017.07.005},
timestamp = {Mon, 16 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Rudow17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/S17,
author = {{Karthik {C. S.}}},
title = {Did the train reach its destination: The complexity of finding a witness},
journal = {Inf. Process. Lett.},
volume = {121},
pages = {17--21},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.004},
doi = {10.1016/J.IPL.2017.01.004},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/S17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SadhyaS17,
author = {Debanjan Sadhya and
Sanjay Kumar Singh},
title = {Privacy risks ensuing from cross-matching among databases: {A} case
study for soft biometrics},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {38--45},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.08.001},
doi = {10.1016/J.IPL.2017.08.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SadhyaS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SaettlerLP17,
author = {Aline Medeiros Saettler and
Eduardo Sany Laber and
Felipe de A. Mello Pereira},
title = {Decision tree classification with bounded number of errors},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {27--31},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.011},
doi = {10.1016/J.IPL.2017.06.011},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SaettlerLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SasikalaBG17,
author = {S. Sasikala and
S. Appavu alias Balamurugan and
S. Geetha},
title = {A novel adaptive feature selector for supervised classification},
journal = {Inf. Process. Lett.},
volume = {117},
pages = {25--34},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.08.003},
doi = {10.1016/J.IPL.2016.08.003},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SasikalaBG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SawadaH17,
author = {Joe Sawada and
Patrick Hartman},
title = {Finding the largest fixed-density necklace and Lyndon word},
journal = {Inf. Process. Lett.},
volume = {125},
pages = {15--19},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.010},
doi = {10.1016/J.IPL.2017.04.010},
timestamp = {Fri, 09 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SawadaH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SherkhonovM17,
author = {Evgeny Sherkhonov and
Maarten Marx},
title = {Containment of acyclic conjunctive queries with negated atoms or arithmetic
comparisons},
journal = {Inf. Process. Lett.},
volume = {120},
pages = {30--39},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.12.005},
doi = {10.1016/J.IPL.2016.12.005},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SherkhonovM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShiQLS17,
author = {Minjia Shi and
Liqin Qian and
Yan Liu and
Patrick Sol{\'{e}}},
title = {Good self-dual generalized quasi-cyclic codes exist},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {21--24},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.09.005},
doi = {10.1016/J.IPL.2016.09.005},
timestamp = {Wed, 19 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ShiQLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SonSKA17,
author = {Wanbin Son and
Fabian Stehn and
Christian Knauer and
Hee{-}Kap Ahn},
title = {Top-k Manhattan spatial skyline queries},
journal = {Inf. Process. Lett.},
volume = {123},
pages = {27--35},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.03.003},
doi = {10.1016/J.IPL.2017.03.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SonSKA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SuZCBCW17,
author = {Sen Su and
Sen Zhao and
Xiang Cheng and
Rong Bi and
Xin Cao and
Jie Wang},
title = {Group-based collective keyword querying in road networks},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {83--90},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.10.008},
doi = {10.1016/J.IPL.2016.10.008},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SuZCBCW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SupeesunF17,
author = {Adisak Supeesun and
Jittat Fakcharoenphol},
title = {Learning network structures from contagion},
journal = {Inf. Process. Lett.},
volume = {121},
pages = {11--16},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.01.005},
doi = {10.1016/J.IPL.2017.01.005},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SupeesunF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TanWW17,
author = {Lijun Tan and
Shiheng Wang and
Ke Wang},
title = {A new adaptive network-based fuzzy inference system with adaptive
adjustment rules for stock market volatility forecasting},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {32--36},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.012},
doi = {10.1016/J.IPL.2017.06.012},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TanWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TiwaryWZ17,
author = {Hans Raj Tiwary and
Stefan Weltge and
Rico Zenklusen},
title = {Extension complexities of Cartesian products involving a pyramid},
journal = {Inf. Process. Lett.},
volume = {128},
pages = {11--13},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.011},
doi = {10.1016/J.IPL.2017.07.011},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TiwaryWZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TsaiC17,
author = {Chang{-}Hsiung Tsai and
Jheng{-}Cheng Chen},
title = {Diagnosable evaluation of enhanced optical transpose interconnection
system networks},
journal = {Inf. Process. Lett.},
volume = {118},
pages = {105--109},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.10.006},
doi = {10.1016/J.IPL.2016.10.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TsaiC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VollalaR17,
author = {Satyanarayana Vollala and
Natarajan Ramasubramanian},
title = {Energy efficient modular exponentiation for public-key cryptography
based on bit forwarding techniques},
journal = {Inf. Process. Lett.},
volume = {119},
pages = {25--38},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.11.007},
doi = {10.1016/J.IPL.2016.11.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VollalaR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangYLP17,
author = {Junhu Wang and
Jeffrey Xu Yu and
Jixue Liu and
Chaoyi Pang},
title = {A revised result on chasing tree patterns under schema graphs},
journal = {Inf. Process. Lett.},
volume = {119},
pages = {19--24},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.11.005},
doi = {10.1016/J.IPL.2016.11.005},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangYLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Widel17,
author = {Wojciech Widel},
title = {Clique-heavy subgraphs and pancyclicity of 2-connected graphs},
journal = {Inf. Process. Lett.},
volume = {117},
pages = {6--9},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.08.004},
doi = {10.1016/J.IPL.2016.08.004},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Widel17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XingZ17,
author = {Rundan Xing and
Bo Zhou},
title = {On the two largest distance eigenvalues of graph powers},
journal = {Inf. Process. Lett.},
volume = {119},
pages = {39--43},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.11.008},
doi = {10.1016/J.IPL.2016.11.008},
timestamp = {Fri, 19 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/XingZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XiongWS17,
author = {Hu Xiong and
Qiang Wang and
Jianfei Sun},
title = {Comments on "Circuit ciphertext-policy attribute-based hybrid encryption
with verifiable delegation"},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {67--70},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.008},
doi = {10.1016/J.IPL.2017.07.008},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XiongWS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuZ17,
author = {Zhaowei Xu and
Wenhui Zhang},
title = {Linear templates of {ACTL} formulas with an application to SAT-based
verification},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {6--16},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.06.008},
doi = {10.1016/J.IPL.2017.06.008},
timestamp = {Tue, 12 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XuZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangZZ17,
author = {Weihua Yang and
Shuli Zhao and
Shurong Zhang},
title = {Strong Menger connectivity with conditional faults of folded hypercubes},
journal = {Inf. Process. Lett.},
volume = {125},
pages = {30--34},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.05.001},
doi = {10.1016/J.IPL.2017.05.001},
timestamp = {Fri, 09 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangZZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YenigunYK17,
author = {H{\"{u}}sn{\"{u}} Yenig{\"{u}}n and
Nina Yevtushenko and
Natalia Kushik},
title = {The complexity of checking the existence and derivation of adaptive
synchronizing experiments for deterministic FSMs},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {49--53},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.001},
doi = {10.1016/J.IPL.2017.07.001},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YenigunYK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuL17,
author = {Ting Yu and
Mengchi Liu},
title = {A linear time algorithm for maximal clique enumeration in large sparse
graphs},
journal = {Inf. Process. Lett.},
volume = {125},
pages = {35--40},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.05.005},
doi = {10.1016/J.IPL.2017.05.005},
timestamp = {Wed, 10 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuMJ17,
author = {Dongjin Yu and
Yunlei Mu and
Yike Jin},
title = {Rating prediction using review texts with underlying sentiments},
journal = {Inf. Process. Lett.},
volume = {117},
pages = {10--18},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.08.002},
doi = {10.1016/J.IPL.2016.08.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YuMJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangA17,
author = {Peng Zhang and
Mikhail J. Atallah},
title = {On approximate pattern matching with thresholds},
journal = {Inf. Process. Lett.},
volume = {123},
pages = {21--26},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.03.001},
doi = {10.1016/J.IPL.2017.03.001},
timestamp = {Mon, 28 Mar 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangDQZL17,
author = {Yunong Zhang and
Yaqiong Ding and
Binbin Qiu and
Yinyan Zhang and
Xiaodong Li},
title = {Signum-function array activated {ZNN} with easier circuit implementation
and finite-time convergence for linear systems solving},
journal = {Inf. Process. Lett.},
volume = {124},
pages = {30--34},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.008},
doi = {10.1016/J.IPL.2017.04.008},
timestamp = {Thu, 26 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangDQZL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangLM17,
author = {Bo Zhang and
Qianmu Li and
Yuanyuan Ma},
title = {Research on dynamic heuristic scanning technique and the application
of the malicious code detection model},
journal = {Inf. Process. Lett.},
volume = {117},
pages = {19--24},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.06.014},
doi = {10.1016/J.IPL.2016.06.014},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangLSNZ17,
author = {Zhao Zhang and
Xiaoting Li and
Yishuo Shi and
Hongmei Nie and
Yuqing Zhu},
title = {{PTAS} for minimum k-path vertex cover in ball graph},
journal = {Inf. Process. Lett.},
volume = {119},
pages = {9--13},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2016.11.003},
doi = {10.1016/J.IPL.2016.11.003},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangLSNZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuL17,
author = {Chun Jiang Zhu and
Kam{-}yiu Lam},
title = {Source-wise round-trip spanners},
journal = {Inf. Process. Lett.},
volume = {124},
pages = {42--45},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.04.009},
doi = {10.1016/J.IPL.2017.04.009},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhuL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/0001KP16,
author = {Sourav Chakraborty and
Akshay Kamath and
Rameshwar Pratap},
title = {Testing whether the uniform distribution is a stationary distribution},
journal = {Inf. Process. Lett.},
volume = {116},
number = {7},
pages = {475--480},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.007},
doi = {10.1016/J.IPL.2016.03.007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/0001KP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Abu-KhzamH16,
author = {Faisal N. Abu{-}Khzam and
Pinar Heggernes},
title = {Enumerating minimal dominating sets in chordal graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {12},
pages = {739--743},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.07.002},
doi = {10.1016/J.IPL.2016.07.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Abu-KhzamH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AggarwalD16,
author = {Divesh Aggarwal and
Chandan K. Dubey},
title = {Improved hardness results for unique shortest vector problem},
journal = {Inf. Process. Lett.},
volume = {116},
number = {10},
pages = {631--637},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.05.003},
doi = {10.1016/J.IPL.2016.05.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AggarwalD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlgefariALL16,
author = {Mansour J. Algefari and
Khalid A. Alsatami and
Hong{-}Jian Lai and
Juan Liu},
title = {Supereulerian digraphs with given local structures},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {321--326},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.12.008},
doi = {10.1016/J.IPL.2015.12.008},
timestamp = {Wed, 31 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AlgefariALL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AmaniLT16,
author = {Mahdi Amani and
Kevin A. Lai and
Robert E. Tarjan},
title = {Amortized rotation cost in {AVL} trees},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {327--330},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.12.009},
doi = {10.1016/J.IPL.2015.12.009},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AmaniLT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AshrafiABFK16,
author = {Ali Reza Ashrafi and
Jernej Azarija and
Azam Babai and
Khadijeh Fathalikhani and
Sandi Klavzar},
title = {The (non-)existence of perfect codes in Fibonacci cubes},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {387--390},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.01.010},
doi = {10.1016/J.IPL.2016.01.010},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AshrafiABFK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarberoGJSY16,
author = {Florian Barbero and
Gregory Z. Gutin and
Mark Jones and
Bin Sheng and
Anders Yeo},
title = {Linear-vertex kernel for the problem of packing r-stars into a graph
without long induced paths},
journal = {Inf. Process. Lett.},
volume = {116},
number = {6},
pages = {433--436},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.01.007},
doi = {10.1016/J.IPL.2016.01.007},
timestamp = {Wed, 22 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BarberoGJSY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Beekman16,
author = {Jethro G. Beekman},
title = {A Denial of Service attack against fair computations using Bitcoin
deposits},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {144--146},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.009},
doi = {10.1016/J.IPL.2015.09.009},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Beekman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BenamaraMB16,
author = {Oualid Benamara and
Fatiha Merazka and
Kamel Betina},
title = {An improvement of a cryptanalysis algorithm},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {192--196},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.002},
doi = {10.1016/J.IPL.2015.08.002},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BenamaraMB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BernardeschiD16,
author = {Cinzia Bernardeschi and
Andrea Domenici},
title = {Verifying safety properties of a nonlinear control by interactive
theorem proving with the Prototype Verification System},
journal = {Inf. Process. Lett.},
volume = {116},
number = {6},
pages = {409--415},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.02.001},
doi = {10.1016/J.IPL.2016.02.001},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BernardeschiD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BestE16,
author = {Eike Best and
Javier Esparza},
title = {Existence of home states in Petri nets is decidable},
journal = {Inf. Process. Lett.},
volume = {116},
number = {6},
pages = {423--427},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.01.011},
doi = {10.1016/J.IPL.2016.01.011},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BestE16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BibakKS16,
author = {Khodakhast Bibak and
Bruce M. Kapron and
Venkatesh Srinivasan},
title = {MMH\({}^{\mbox{{\unicode{8270}}}}\) with arbitrary modulus is always
almost-universal},
journal = {Inf. Process. Lett.},
volume = {116},
number = {7},
pages = {481--483},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.009},
doi = {10.1016/J.IPL.2016.03.009},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BibakKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BonacinaT16,
author = {Ilario Bonacina and
Navid Talebanfard},
title = {Improving resolution width lower bounds for k-CNFs with applications
to the Strong Exponential Time Hypothesis},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {120--124},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.013},
doi = {10.1016/J.IPL.2015.09.013},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BonacinaT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Borassi16,
author = {Michele Borassi},
title = {A note on the complexity of computing the number of reachable vertices
in a digraph},
journal = {Inf. Process. Lett.},
volume = {116},
number = {10},
pages = {628--630},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.05.002},
doi = {10.1016/J.IPL.2016.05.002},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Borassi16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BouyerGM16,
author = {Patricia Bouyer and
Patrick Gardy and
Nicolas Markey},
title = {On the semantics of Strategy Logic},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {75--79},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.10.004},
doi = {10.1016/J.IPL.2015.10.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BouyerGM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BouzidIR16,
author = {Zohir Bouzid and
Damien Imbs and
Michel Raynal},
title = {A necessary condition for Byzantine k-set agreement},
journal = {Inf. Process. Lett.},
volume = {116},
number = {12},
pages = {757--759},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.009},
doi = {10.1016/J.IPL.2016.06.009},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BouzidIR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BredereckT16,
author = {Robert Bredereck and
Nimrod Talmon},
title = {NP-hardness of two edge cover generalizations with applications to
control and bribery for approval voting},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {147--152},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.008},
doi = {10.1016/J.IPL.2015.09.008},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BredereckT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CaiZ16,
author = {Junqing Cai and
Yuzhong Zhang},
title = {Fan-type implicit-heavy subgraphs for hamiltonicity of implicit claw-heavy
graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {668--673},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.012},
doi = {10.1016/J.IPL.2016.06.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CaiZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CapraraFMT16,
author = {Alberto Caprara and
Fabio Furini and
Enrico Malaguti and
Emiliano Traversi},
title = {Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe
Reformulation},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {379--386},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.01.008},
doi = {10.1016/J.IPL.2016.01.008},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CapraraFMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CarayolS16,
author = {Arnaud Carayol and
Olivier Serre},
title = {Marking shortest paths on pushdown graphs does not preserve {MSO}
decidability},
journal = {Inf. Process. Lett.},
volume = {116},
number = {10},
pages = {638--643},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.015},
doi = {10.1016/J.IPL.2016.04.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CarayolS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangCYW16,
author = {Jou{-}Ming Chang and
Xiang{-}Rui Chen and
Jinn{-}Shyong Yang and
Ro{-}Yu Wu},
title = {Locally exchanged twisted cubes: Connectivity and super connectivity},
journal = {Inf. Process. Lett.},
volume = {116},
number = {7},
pages = {460--466},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.003},
doi = {10.1016/J.IPL.2016.03.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChangCYW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen16,
author = {Xie{-}Bin Chen},
title = {Paired 2-disjoint path covers of multidimensional torus networks with
faulty edges},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {107--110},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.10.001},
doi = {10.1016/J.IPL.2015.10.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen16a,
author = {Xie{-}Bin Chen},
title = {Hamiltonicity of hypercubes with faulty vertices},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {343--346},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.018},
doi = {10.1016/J.IPL.2015.09.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Chen16b,
author = {Ke Chen},
title = {Improved neural dynamics for online Sylvester equations solving},
journal = {Inf. Process. Lett.},
volume = {116},
number = {7},
pages = {455--459},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.004},
doi = {10.1016/J.IPL.2016.03.004},
timestamp = {Mon, 18 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Chen16b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenP16,
author = {Shiteng Chen and
Periklis A. Papakonstantinou},
title = {Correlation lower bounds from correlation upper bounds},
journal = {Inf. Process. Lett.},
volume = {116},
number = {8},
pages = {537--540},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.012},
doi = {10.1016/J.IPL.2016.03.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenS16,
author = {Chien Chin Chen and
Yu{-}Chun Sun},
title = {Exploring acquaintances of social network site users for effective
social event recommendations},
journal = {Inf. Process. Lett.},
volume = {116},
number = {3},
pages = {227--236},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.013},
doi = {10.1016/J.IPL.2015.11.013},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenSX16,
author = {Yao Chen and
Kang G. Shin and
Huagang Xiong},
title = {Generalizing fixed-priority scheduling for better schedulability in
mixed-criticality systems},
journal = {Inf. Process. Lett.},
volume = {116},
number = {8},
pages = {508--512},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.02.009},
doi = {10.1016/J.IPL.2016.02.009},
timestamp = {Tue, 07 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenSX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenT16,
author = {Y{-}Chuang Chen and
Tsung{-}Han Tsai},
title = {Hamiltonian decomposition of generalized recursive circulant graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {585--589},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.003},
doi = {10.1016/J.IPL.2016.04.003},
timestamp = {Sat, 22 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CherniavskyGLS16,
author = {Yonah Cherniavsky and
Avraham Goldstein and
Vadim E. Levit and
Robert Shwartz},
title = {Enumeration of balanced finite group valued functions on directed
graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {7},
pages = {484--488},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.02.002},
doi = {10.1016/J.IPL.2016.02.002},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CherniavskyGLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChhabraT16,
author = {Tamanna Chhabra and
Jorma Tarhio},
title = {A filtration method for order-preserving matching},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {71--74},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.10.005},
doi = {10.1016/J.IPL.2015.10.005},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChhabraT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Damaschke16,
author = {Peter Damaschke},
title = {Sufficient conditions for edit-optimal clusters},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {267--272},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.12.004},
doi = {10.1016/J.IPL.2015.12.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Damaschke16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DantasFFT16,
author = {Simone Dantas and
Lu{\'{e}}rbio Faria and
Celina M. H. de Figueiredo and
Rafael B. Teixeira},
title = {The (k, {\(\mathscr{l}\)}) unpartitioned probe problem NP-complete
versus polynomial dichotomy},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {294--298},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.004},
doi = {10.1016/J.IPL.2015.11.004},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DantasFFT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DarwishM16,
author = {Omar Darwish and
Kurt Mehlhorn},
title = {Improved balanced flow computation using parametric flow},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {560--563},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.008},
doi = {10.1016/J.IPL.2016.04.008},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DarwishM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasG16,
author = {Ananda Swarup Das and
Prosenjit Gupta},
title = {Linear space adaptive data structures for planar range reporting},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {361--366},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.01.001},
doi = {10.1016/J.IPL.2016.01.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DasG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DehghanS16,
author = {Ali Dehghan and
Mohammad{-}Reza Sadeghi},
title = {On the algorithmic complexity of zero-sum edge-coloring},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {660--667},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.010},
doi = {10.1016/J.IPL.2016.06.010},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DehghanS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Draziotis16,
author = {Konstantinos A. Draziotis},
title = {{(EC)DSA} lattice attacks based on Coppersmith's method},
journal = {Inf. Process. Lett.},
volume = {116},
number = {8},
pages = {541--545},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.001},
doi = {10.1016/J.IPL.2016.04.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Draziotis16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EdemskiyP16,
author = {Vladimir Edemskiy and
A. Palvinskiy},
title = {The linear complexity of binary sequences of length 2p with optimal
three-level autocorrelation},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {153--156},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.007},
doi = {10.1016/J.IPL.2015.09.007},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/EdemskiyP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EhdaieAAAP16,
author = {Mohammad Ehdaie and
Nikos Alexiou and
Mahmoud Ahmadian{-}Attari and
Mohammad Reza Aref and
Panos Papadimitratos},
title = {2D Hash Chain robust Random Key Distribution scheme},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {367--372},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.12.006},
doi = {10.1016/J.IPL.2015.12.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EhdaieAAAP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EpsteinZ16,
author = {Leah Epstein and
Hanan Zebedat{-}Haider},
title = {Online scheduling of unit jobs on three machines with rejection: {A}
tight result},
journal = {Inf. Process. Lett.},
volume = {116},
number = {3},
pages = {252--255},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.012},
doi = {10.1016/J.IPL.2015.11.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EpsteinZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FangL16,
author = {Yang Fang and
Xiwen Lu},
title = {Online parallel-batch scheduling to minimize total weighted completion
time on single unbounded machine},
journal = {Inf. Process. Lett.},
volume = {116},
number = {8},
pages = {526--531},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.010},
doi = {10.1016/J.IPL.2016.03.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FangL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fay16,
author = {Robin Fay},
title = {Introducing the counter mode of operation to Compressed Sensing based
encryption},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {279--283},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.010},
doi = {10.1016/J.IPL.2015.11.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fay16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FiciKRRW16,
author = {Gabriele Fici and
Tomasz Kociumaka and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
title = {On the greedy algorithm for the Shortest Common Superstring problem
with reversals},
journal = {Inf. Process. Lett.},
volume = {116},
number = {3},
pages = {245--251},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.015},
doi = {10.1016/J.IPL.2015.11.015},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FiciKRRW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fujii16,
author = {Kaito Fujii},
title = {Faster approximation algorithms for maximizing a monotone submodular
function subject to a b-matching constraint},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {578--584},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.004},
doi = {10.1016/J.IPL.2016.04.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fujii16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GerbnerKPP16,
author = {D{\'{a}}niel Gerbner and
Bal{\'{a}}zs Keszegh and
Cory Palmer and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
title = {Topological orderings of weighted directed acyclic graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {564--568},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.007},
doi = {10.1016/J.IPL.2016.04.007},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GerbnerKPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoPT16,
author = {Fan Guo and
Hui Peng and
Jin Tang},
title = {Genetic algorithm-based parameter selection approach to single image
defogging},
journal = {Inf. Process. Lett.},
volume = {116},
number = {10},
pages = {595--602},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.013},
doi = {10.1016/J.IPL.2016.04.013},
timestamp = {Mon, 25 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuoPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoSS16,
author = {Chuan Guo and
Jeffrey O. Shallit and
Arseny M. Shur},
title = {Palindromic rich words and run-length encodings},
journal = {Inf. Process. Lett.},
volume = {116},
number = {12},
pages = {735--738},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.07.001},
doi = {10.1016/J.IPL.2016.07.001},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuoSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GutinW16,
author = {Gregory Z. Gutin and
Magnus Wahlstr{\"{o}}m},
title = {Tight lower bounds for the Workflow Satisfiability Problem based on
the Strong Exponential Time Hypothesis},
journal = {Inf. Process. Lett.},
volume = {116},
number = {3},
pages = {223--226},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.008},
doi = {10.1016/J.IPL.2015.11.008},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GutinW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HaaseK16,
author = {Christoph Haase and
Stefan Kiefer},
title = {The complexity of the Kth largest subset problem and related problems},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {111--115},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.015},
doi = {10.1016/J.IPL.2015.09.015},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HaaseK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Harwath16,
author = {Frederik Harwath},
title = {A note on the size of prenex normal forms},
journal = {Inf. Process. Lett.},
volume = {116},
number = {7},
pages = {443--446},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.005},
doi = {10.1016/J.IPL.2016.03.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Harwath16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Henry16,
author = {Christopher S. Henry},
title = {The (nested) word problem},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {729--734},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.013},
doi = {10.1016/J.IPL.2016.06.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Henry16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HokamaMS16,
author = {Pedro Henrique Del Bianco Hokama and
Fl{\'{a}}vio Keidi Miyazawa and
Rafael Crivellari Saliba Schouery},
title = {A bounded space algorithm for online circle packing},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {337--342},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.12.007},
doi = {10.1016/J.IPL.2015.12.007},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HokamaMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HongL16,
author = {Xia Hong and
Qinghai Liu},
title = {Degree condition for completely independent spanning trees},
journal = {Inf. Process. Lett.},
volume = {116},
number = {10},
pages = {644--648},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.05.004},
doi = {10.1016/J.IPL.2016.05.004},
timestamp = {Thu, 19 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HongL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuZX16,
author = {Zhi Hu and
Guoliang Zhang and
Maozhi Xu},
title = {Some techniques for faster scalar multiplication on {GLS} curves},
journal = {Inf. Process. Lett.},
volume = {116},
number = {1},
pages = {41--46},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.001},
doi = {10.1016/J.IPL.2015.09.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HuZX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ivan16,
author = {Szabolcs Iv{\'{a}}n},
title = {Complexity of atoms, combinatorially},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {356--360},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.01.003},
doi = {10.1016/J.IPL.2016.01.003},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Ivan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JaddiAH16,
author = {Najmeh Sadat Jaddi and
Salwani Abdullah and
Abdul Razak Hamdan},
title = {A solution representation of genetic algorithm for neural network
weights and structure},
journal = {Inf. Process. Lett.},
volume = {116},
number = {1},
pages = {22--25},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.001},
doi = {10.1016/J.IPL.2015.08.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JaddiAH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JanczewskiT16,
author = {Robert Janczewski and
Krzysztof Turowski},
title = {On the hardness of computing span of subcubic graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {1},
pages = {26--32},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.009},
doi = {10.1016/J.IPL.2015.08.009},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JanczewskiT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JannatiB16,
author = {Hoda Jannati and
Behnam Bahrak},
title = {Security analysis of an {RFID} tag search protocol},
journal = {Inf. Process. Lett.},
volume = {116},
number = {10},
pages = {618--622},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.05.001},
doi = {10.1016/J.IPL.2016.05.001},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JannatiB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jiang16,
author = {Shaoquan Jiang},
title = {On message authentication with a correlated setup},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {289--293},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.006},
doi = {10.1016/J.IPL.2015.11.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jiang16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JiangW16,
author = {Sheng{-}Yi Jiang and
Lian{-}xi Wang},
title = {Efficient feature selection based on correlation measure between continuous
and discrete features},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {203--215},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.07.005},
doi = {10.1016/J.IPL.2015.07.005},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JiangW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KapelkoK16,
author = {Rafal Kapelko and
Evangelos Kranakis},
title = {On the displacement for covering a unit interval with randomly placed
sensors},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {710--717},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.004},
doi = {10.1016/J.IPL.2016.06.004},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KapelkoK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Katrenic16,
author = {J{\'{a}}n Katrenic},
title = {A faster {FPT} algorithm for 3-path vertex cover},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {273--278},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.12.002},
doi = {10.1016/J.IPL.2015.12.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Katrenic16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KitaevV16,
author = {Sergey Kitaev and
Vincent Vajnovszki},
title = {Mahonian {STAT} on words},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {157--162},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.006},
doi = {10.1016/J.IPL.2015.09.006},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KitaevV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KiyomiO16,
author = {Masashi Kiyomi and
Yota Otachi},
title = {Finding a chain graph in a bipartite permutation graph},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {569--573},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.006},
doi = {10.1016/J.IPL.2016.04.006},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KiyomiO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KobayashiHKS16,
author = {Yuki Kobayashi and
Yuya Higashikawa and
Naoki Katoh and
Adnan Sljoka},
title = {Characterizing redundant rigidity and redundant global rigidity of
body-hinge graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {175--178},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.011},
doi = {10.1016/J.IPL.2015.08.011},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KobayashiHKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KobayashiT16,
author = {Yasuaki Kobayashi and
Hisao Tamaki},
title = {A faster fixed parameter algorithm for two-layer crossing minimization},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {547--549},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.012},
doi = {10.1016/J.IPL.2016.04.012},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KobayashiT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KohlerM16,
author = {Ekkehard K{\"{o}}hler and
Lalla Mouatadid},
title = {A linear time algorithm to compute a maximum weighted independent
set on cocomparability graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {6},
pages = {391--395},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.12.001},
doi = {10.1016/J.IPL.2015.12.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KohlerM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KolR16,
author = {Gillat Kol and
Ran Raz},
title = {Bounds on 2-query Locally Testable Codes with affine tests},
journal = {Inf. Process. Lett.},
volume = {116},
number = {8},
pages = {521--525},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.008},
doi = {10.1016/J.IPL.2016.03.008},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KolR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kosolobov16,
author = {Dmitry Kosolobov},
title = {Computing runs on a general alphabet},
journal = {Inf. Process. Lett.},
volume = {116},
number = {3},
pages = {241--244},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.016},
doi = {10.1016/J.IPL.2015.11.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kosolobov16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KostylevRV16,
author = {Egor V. Kostylev and
Juan L. Reutter and
Domagoj Vrgoc},
title = {Static analysis of navigational XPath over graph databases},
journal = {Inf. Process. Lett.},
volume = {116},
number = {7},
pages = {467--474},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.006},
doi = {10.1016/J.IPL.2016.03.006},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KostylevRV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KunduM16,
author = {Sukhamay Kundu and
Subhashis Majumder},
title = {A linear time algorithm for optimal k-hop dominating set of a tree},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {197--202},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.07.014},
doi = {10.1016/J.IPL.2015.07.014},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KunduM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KuoWH16,
author = {Wen{-}Chung Kuo and
Chun{-}Cheng Wang and
Hong{-}Ching Hou},
title = {Signed digit data hiding scheme},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {183--191},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.003},
doi = {10.1016/J.IPL.2015.08.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KuoWH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lai16,
author = {Cheng{-}Nan Lai},
title = {On the construction of all shortest node-disjoint paths in star networks},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {299--303},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.003},
doi = {10.1016/J.IPL.2015.11.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lai16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Laihonen16,
author = {Tero Laihonen},
title = {The metric dimension for resolving several objects},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {694--700},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.002},
doi = {10.1016/J.IPL.2016.06.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Laihonen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lalla-RuizIMM16,
author = {Eduardo Lalla{-}Ruiz and
Christopher {Exp{\'{o}}sito Izquierdo} and
Bel{\'{e}}n Meli{\'{a}}n{-}Batista and
J. Marcos Moreno{-}Vega},
title = {A Hybrid Biased Random Key Genetic Algorithm for the Quadratic Assignment
Problem},
journal = {Inf. Process. Lett.},
volume = {116},
number = {8},
pages = {513--520},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.002},
doi = {10.1016/J.IPL.2016.03.002},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Lalla-RuizIMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LanHWGC16,
author = {Yan Lan and
Xin Han and
Zongtao Wu and
He Guo and
Xin Chen},
title = {Complexity of problem \emph{TF}2{\(\vert\)}v=1, c=2{\(\vert\)}C\({}_{\mbox{max}}\)},
journal = {Inf. Process. Lett.},
volume = {116},
number = {1},
pages = {65--69},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.003},
doi = {10.1016/J.IPL.2015.09.003},
timestamp = {Thu, 03 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LanHWGC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LeeMSN16,
author = {Mun{-}Kyu Lee and
Pierre Michaud and
Jeong Seop Sim and
DaeHun Nyang},
title = {A simple proof of optimality for the {MIN} cache replacement policy},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {168--170},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.004},
doi = {10.1016/J.IPL.2015.09.004},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LeeMSN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiL16,
author = {Jiyou Li and
Chu Luo},
title = {The simplified weighted sum function and its average sensitivity},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {331--336},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.01.002},
doi = {10.1016/J.IPL.2016.01.002},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiottaM16,
author = {Giuseppe Liotta and
Fabrizio Montecchiani},
title = {L-visibility drawings of IC-planar graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {3},
pages = {217--222},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.011},
doi = {10.1016/J.IPL.2015.11.011},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiottaM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuFWSW16,
author = {Yu Liu and
Kai Fu and
Wei Wang and
Ling Sun and
Meiqin Wang},
title = {Linear cryptanalysis of reduced-round {SPECK}},
journal = {Inf. Process. Lett.},
volume = {116},
number = {3},
pages = {259--266},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.005},
doi = {10.1016/J.IPL.2015.11.005},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiuFWSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiuMCG16,
author = {Lingfeng Liu and
Suoxia Miao and
Mengfan Cheng and
Xiaojing Gao},
title = {A pseudorandom bit generator based on new multi-delayed Chebyshev
map},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {674--681},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.011},
doi = {10.1016/J.IPL.2016.06.011},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiuMCG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MahajanS16,
author = {Meena Mahajan and
Anil Shukla},
title = {Level-ordered Q-resolution and tree-like Q-resolution are incomparable},
journal = {Inf. Process. Lett.},
volume = {116},
number = {3},
pages = {256--258},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.017},
doi = {10.1016/J.IPL.2015.11.017},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MahajanS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MahajanST16,
author = {Meena Mahajan and
Nitin Saurabh and
S{\'{e}}bastien Tavenas},
title = {VNP=VP in the multilinear world},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {179--182},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.004},
doi = {10.1016/J.IPL.2015.08.004},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MahajanST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaiseliG16,
author = {Baraka Jacob Maiseli and
Huijun Gao},
title = {Robust edge detector based on anisotropic diffusion-driven process},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {373--378},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.12.003},
doi = {10.1016/J.IPL.2015.12.003},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MaiseliG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ManakK16,
author = {Martin Manak and
Ivana Kolingerov{\'{a}}},
title = {Extension of the edge tracing algorithm to disconnected Voronoi skeletons},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {85--92},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.017},
doi = {10.1016/J.IPL.2015.09.017},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ManakK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MitzenmacherN16,
author = {Michael Mitzenmacher and
Vikram Nathan},
title = {Hardness of peeling with stashes},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {682--688},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.05.006},
doi = {10.1016/J.IPL.2016.05.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MitzenmacherN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MolineroOS16,
author = {Xavier Molinero and
Martin Olsen and
Maria J. Serna},
title = {On the complexity of exchanging},
journal = {Inf. Process. Lett.},
volume = {116},
number = {6},
pages = {437--441},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.01.004},
doi = {10.1016/J.IPL.2016.01.004},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MolineroOS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Morsy16,
author = {Ehab Morsy},
title = {An extension of Hall's theorem for partitioned bipartite graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {706--709},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.005},
doi = {10.1016/J.IPL.2016.06.005},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Morsy16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MotaIM16,
author = {Alexandre Mota and
Juliano Iyoda and
Heitor Maranh{\~{a}}o},
title = {Program synthesis by model finding},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {701--705},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.003},
doi = {10.1016/J.IPL.2016.06.003},
timestamp = {Thu, 09 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MotaIM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NguyenTD16,
author = {Minh Tan Nguyen and
Quang Hai Truong and
Tran Khanh Dang},
title = {Enhance fuzzy vault security using nonrandom chaff point generator},
journal = {Inf. Process. Lett.},
volume = {116},
number = {1},
pages = {53--64},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.012},
doi = {10.1016/J.IPL.2015.08.012},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NguyenTD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ning16,
author = {Wantao Ning},
title = {The super connectivity of exchanged crossed cube},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {80--84},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.10.003},
doi = {10.1016/J.IPL.2015.10.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ning16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/OuZL16,
author = {Jinwen Ou and
Xueling Zhong and
Chung{-}Lun Li},
title = {Faster algorithms for single machine scheduling with release dates
and rejection},
journal = {Inf. Process. Lett.},
volume = {116},
number = {8},
pages = {503--507},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.02.008},
doi = {10.1016/J.IPL.2016.02.008},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/OuZL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PaiCY16,
author = {Kung{-}Jui Pai and
Jou{-}Ming Chang and
Jinn{-}Shyong Yang},
title = {Vertex-transitivity on folded crossed cubes},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {689--693},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.001},
doi = {10.1016/J.IPL.2016.06.001},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PaiCY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ParkYYC16,
author = {Jong{-}Min Park and
Hyung{-}Jeong Yang and
Jae{-}Dong Yang and
Dong{-}Hoon Choi},
title = {A technique for the concept-based detection of functional modules
in an interaction network},
journal = {Inf. Process. Lett.},
volume = {116},
number = {10},
pages = {611--617},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.018},
doi = {10.1016/J.IPL.2015.11.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ParkYYC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Parys16,
author = {Pawel Parys},
title = {Weak containment for partial words is coNP-complete},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {125--127},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.012},
doi = {10.1016/J.IPL.2015.09.012},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Parys16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Pearce16,
author = {David J. Pearce},
title = {A space-efficient algorithm for finding strongly connected components},
journal = {Inf. Process. Lett.},
volume = {116},
number = {1},
pages = {47--52},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.010},
doi = {10.1016/J.IPL.2015.08.010},
timestamp = {Wed, 26 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Pearce16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PontarelliRM16,
author = {Salvatore Pontarelli and
Pedro Reviriego and
Juan Antonio Maestro},
title = {Improving counting Bloom filter performance with fingerprints},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {304--309},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.002},
doi = {10.1016/J.IPL.2015.11.002},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PontarelliRM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Puleo16,
author = {Gregory J. Puleo},
title = {Complexity of a disjoint matching problem on bipartite graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {10},
pages = {649--652},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.05.005},
doi = {10.1016/J.IPL.2016.05.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Puleo16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/QinD16,
author = {Huawang Qin and
Yuewei Dai},
title = {Verifiable (t, n) threshold quantum secret sharing using d-dimensional
Bell state},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {351--355},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.01.005},
doi = {10.1016/J.IPL.2016.01.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/QinD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/QinYWX16,
author = {Zhen Qin and
Chen Yuan and
Yilei Wang and
Hu Xiong},
title = {On the security of two identity-based signature schemes based on pairings},
journal = {Inf. Process. Lett.},
volume = {116},
number = {6},
pages = {416--418},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.02.003},
doi = {10.1016/J.IPL.2016.02.003},
timestamp = {Sat, 25 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/QinYWX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RoayaeiR16,
author = {Mehdy Roayaei and
Mohammadreza Razzazi},
title = {An FPT-algorithm for modifying a graph of bounded treewidth to decrease
the size of its dominating set using minimum modification},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {590--594},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.002},
doi = {10.1016/J.IPL.2016.04.002},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RoayaeiR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sanders016,
author = {Peter Sanders and
Christian Schulz},
title = {Scalable generation of scale-free graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {7},
pages = {489--491},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.02.004},
doi = {10.1016/J.IPL.2016.02.004},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Sanders016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShiauSW16,
author = {Alexander Chane Shiau and
Tzong{-}Huei Shiau and
Yue{-}Li Wang},
title = {Corrigendum to "Incidence coloring of Cartesian product graphs" [Inf.
Process. Lett. {(2015)} 765-768]},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {216},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.005},
doi = {10.1016/J.IPL.2015.08.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShiauSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Simon16,
author = {Hans Ulrich Simon},
title = {Efficient computation of approximate isomorphisms between Boolean
functions},
journal = {Inf. Process. Lett.},
volume = {116},
number = {3},
pages = {237--240},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.009},
doi = {10.1016/J.IPL.2015.11.009},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Simon16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SongSZW16,
author = {Yalin Song and
Yaoru Sun and
Hong Zhang and
Fang Wang},
title = {Activity testing model for automatic correction of hand pointing},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {653--659},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.008},
doi = {10.1016/J.IPL.2016.06.008},
timestamp = {Thu, 08 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/SongSZW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Storch16,
author = {Tobias Storch},
title = {Black-box complexity: Advantages of memory usage},
journal = {Inf. Process. Lett.},
volume = {116},
number = {6},
pages = {428--432},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.01.009},
doi = {10.1016/J.IPL.2016.01.009},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Storch16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Struth16,
author = {Georg Struth},
title = {On the expressive power of Kleene algebra with domain},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {284--288},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.007},
doi = {10.1016/J.IPL.2015.11.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Struth16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SuksompongLS16,
author = {Warut Suksompong and
Charles E. Leiserson and
Tao B. Schardl},
title = {On the efficiency of localized work stealing},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {100--106},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.10.002},
doi = {10.1016/J.IPL.2015.10.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SuksompongLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Sun16,
author = {Shuliang Sun},
title = {A novel edge based image steganography with 2\({}^{\mbox{k}}\) correction
and Huffman encoding},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {93--99},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.016},
doi = {10.1016/J.IPL.2015.09.016},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Sun16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SunWW16,
author = {Jia Sun and
Shiheng Wang and
Ke Wang},
title = {Zhang neural networks for a set of linear matrix inequalities with
time-varying coefficient matrix},
journal = {Inf. Process. Lett.},
volume = {116},
number = {10},
pages = {603--610},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.014},
doi = {10.1016/J.IPL.2016.04.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SunWW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TaLL16,
author = {Toan Thang Ta and
Cheng{-}Yao Lin and
Chin Lung Lu},
title = {An efficient algorithm for computing non-overlapping inversion and
transposition distance},
journal = {Inf. Process. Lett.},
volume = {116},
number = {12},
pages = {744--749},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.07.004},
doi = {10.1016/J.IPL.2016.07.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TaLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Takazawa16,
author = {Kenjiro Takazawa},
title = {A 7/6-approximation algorithm for the minimum 2-edge connected subgraph
problem in bipartite cubic graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {550--553},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.011},
doi = {10.1016/J.IPL.2016.04.011},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Takazawa16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TanLWZ16,
author = {Haisheng Tan and
Hongyu Liang and
Rui Wang and
Jipeng Zhou},
title = {Computing Roman domatic number of graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {554--559},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.010},
doi = {10.1016/J.IPL.2016.04.010},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TanLWZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TanPL16,
author = {Chik How Tan and
Theo Fanuela Prabowo and
Duc{-}Phong Le},
title = {Breaking an ID-based encryption based on discrete logarithm and factorization
problems},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {116--119},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.014},
doi = {10.1016/J.IPL.2015.09.014},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TanPL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TanY16,
author = {Syh{-}Yuan Tan and
Wun{-}She Yap},
title = {Cryptanalysis of a {CP-ABE} scheme with policy in normal forms},
journal = {Inf. Process. Lett.},
volume = {116},
number = {7},
pages = {492--495},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.02.006},
doi = {10.1016/J.IPL.2016.02.006},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TanY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TanZF16,
author = {Xiaoqing Tan and
Xiaoqian Zhang and
Junbin Fang},
title = {Perfect quantum teleportation by four-particle cluster state},
journal = {Inf. Process. Lett.},
volume = {116},
number = {5},
pages = {347--350},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.01.006},
doi = {10.1016/J.IPL.2016.01.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TanZF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TezcanS16,
author = {Cihangir Tezcan and
Ali Aydin Sel{\c{c}}uk},
title = {Improved improbable differential attacks on {ISO} standard {CLEFIA:}
Expansion technique revisited},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {136--143},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.010},
doi = {10.1016/J.IPL.2015.09.010},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TezcanS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TolbaY16,
author = {Mohamed Tolba and
Amr M. Youssef},
title = {Generalized MitM attacks on full {TWINE}},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {128--135},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.011},
doi = {10.1016/J.IPL.2015.09.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TolbaY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangH16,
author = {Shiying Wang and
Weiping Han},
title = {The g-good-neighbor conditional diagnosability of n-dimensional hypercubes
under the MM\({}^{\mbox{{\unicode{8270}}}}\) model},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {574--577},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.005},
doi = {10.1016/J.IPL.2016.04.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangS16,
author = {Chao Wang and
Ren{\'{e}} Sitters},
title = {On some special cases of the restricted assignment problem},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {723--728},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.007},
doi = {10.1016/J.IPL.2016.06.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WangZQH16,
author = {Rui Wang and
Yongquan Zhou and
Shilei Qiao and
Kang Huang},
title = {Flower Pollination Algorithm with Bee Pollinator for cluster analysis},
journal = {Inf. Process. Lett.},
volume = {116},
number = {1},
pages = {1--14},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.007},
doi = {10.1016/J.IPL.2015.08.007},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WangZQH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuDH16,
author = {Yahui Wu and
Su Deng and
Hongbin Huang},
title = {Capacity and delay analysis in delay tolerant network with multiple
communities},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {310--315},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.001},
doi = {10.1016/J.IPL.2015.11.001},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuDH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XiangLWZ16,
author = {Xinyin Xiang and
Hui Li and
Mingyu Wang and
Xingwen Zhao},
title = {Efficient multi-party concurrent signature from lattices},
journal = {Inf. Process. Lett.},
volume = {116},
number = {8},
pages = {497--502},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.02.007},
doi = {10.1016/J.IPL.2016.02.007},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/XiangLWZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XieZBX16,
author = {Fang Xie and
Yuzhong Zhang and
Qingguo Bai and
Zhe Xu},
title = {Inefficiency analysis of the scheduling game on limited identical
machines with activation costs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {4},
pages = {316--320},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.10.006},
doi = {10.1016/J.IPL.2015.10.006},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/XieZBX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/XuLZ16,
author = {Jin Xu and
Zepeng Li and
Enqiang Zhu},
title = {On purely tree-colorable planar graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {8},
pages = {532--536},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.011},
doi = {10.1016/J.IPL.2016.03.011},
timestamp = {Fri, 17 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/XuLZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangL16,
author = {Zheng Yang and
Shuangqing Li},
title = {On security analysis of an after-the-fact leakage resilient key exchange
protocol},
journal = {Inf. Process. Lett.},
volume = {116},
number = {1},
pages = {33--40},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.006},
doi = {10.1016/J.IPL.2015.08.006},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YangL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangLGC16,
author = {Bin Yang and
Jie Luo and
Ling Guo and
Fang Cheng},
title = {Simultaneous image fusion and demosaicing via compressive sensing},
journal = {Inf. Process. Lett.},
volume = {116},
number = {7},
pages = {447--454},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.03.001},
doi = {10.1016/J.IPL.2016.03.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangLGC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangLLL16,
author = {Liang Yang and
Bing Liu and
Hongfei Lin and
Yuan Lin},
title = {Combining local and global information for product feature extraction
in opinion documents},
journal = {Inf. Process. Lett.},
volume = {116},
number = {10},
pages = {623--627},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.009},
doi = {10.1016/J.IPL.2016.04.009},
timestamp = {Tue, 09 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangLLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangYR16,
author = {Chao Yang and
Bing Yao and
Han Ren},
title = {A note on graph proper total colorings with many distinguishing constraints},
journal = {Inf. Process. Lett.},
volume = {116},
number = {6},
pages = {396--400},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.11.014},
doi = {10.1016/J.IPL.2015.11.014},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YangYR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuanL16,
author = {Jun Yuan and
Aixia Liu},
title = {Sufficient conditions for triangle-free graphs to be super k-restricted
edge-connected},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {163--167},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.005},
doi = {10.1016/J.IPL.2015.09.005},
timestamp = {Fri, 30 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/YuanL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zehavi16,
author = {Meirav Zehavi},
title = {A randomized algorithm for long directed cycle},
journal = {Inf. Process. Lett.},
volume = {116},
number = {6},
pages = {419--422},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.02.005},
doi = {10.1016/J.IPL.2016.02.005},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Zehavi16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangSLW16,
author = {Defu Zhang and
Leyuan Shi and
Stephen C. H. Leung and
Tao Wu},
title = {A priority heuristic for the guillotine rectangular packing problem},
journal = {Inf. Process. Lett.},
volume = {116},
number = {1},
pages = {15--21},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.08.008},
doi = {10.1016/J.IPL.2015.08.008},
timestamp = {Thu, 28 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangSLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangZH16,
author = {Meng Zhang and
Yi Zhang and
Chen Hou},
title = {Compact representations of automata for regular expression matching},
journal = {Inf. Process. Lett.},
volume = {116},
number = {12},
pages = {750--756},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.07.003},
doi = {10.1016/J.IPL.2016.07.003},
timestamp = {Thu, 31 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZhangZH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zhou16,
author = {Gelin Zhou},
title = {Two-dimensional range successor in optimal time and almost linear
space},
journal = {Inf. Process. Lett.},
volume = {116},
number = {2},
pages = {171--174},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.09.002},
doi = {10.1016/J.IPL.2015.09.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zhou16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhuLSX16,
author = {Enqiang Zhu and
Zepeng Li and
Zehui Shao and
Jin Xu},
title = {Acyclically 4-colorable triangulations},
journal = {Inf. Process. Lett.},
volume = {116},
number = {6},
pages = {401--408},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2015.12.005},
doi = {10.1016/J.IPL.2015.12.005},
timestamp = {Wed, 08 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhuLSX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZuylenBSY16,
author = {Anke van Zuylen and
James C. Bieron and
Frans Schalekamp and
Gexin Yu},
title = {A tight upper bound on the number of cyclically adjacent transpositions
to sort a permutation},
journal = {Inf. Process. Lett.},
volume = {116},
number = {11},
pages = {718--722},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.06.006},
doi = {10.1016/J.IPL.2016.06.006},
timestamp = {Thu, 10 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ZuylenBSY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AcetoGI15,
author = {Luca Aceto and
Eugen{-}Ioan Goriac and
Anna Ing{\'{o}}lfsd{\'{o}}ttir},
title = {A ground-complete axiomatization of stateless bisimilarity over Linda},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {212--220},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.014},
doi = {10.1016/J.IPL.2014.09.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AcetoGI15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Aggarwal15,
author = {Divesh Aggarwal},
title = {Affine-evasive sets modulo a prime},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {382--385},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.015},
doi = {10.1016/J.IPL.2014.10.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Aggarwal15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AgostaBPS15,
author = {Giovanni Agosta and
Alessandro Barenghi and
Gerardo Pelosi and
Michele Scandale},
title = {Trace-based schedulability analysis to enhance passive side-channel
attack resilience of embedded software},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {292--297},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.030},
doi = {10.1016/J.IPL.2014.09.030},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AgostaBPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AignerAJ15,
author = {Wolfgang Aigner and
Franz Aurenhammer and
Bert J{\"{u}}ttler},
title = {On triangulation axes of polygons},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {45--51},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.006},
doi = {10.1016/J.IPL.2014.08.006},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AignerAJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AkshayAOW15,
author = {S. Akshay and
Timos Antonopoulos and
Jo{\"{e}}l Ouaknine and
James Worrell},
title = {Reachability problems for Markov chains},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {155--158},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.013},
doi = {10.1016/J.IPL.2014.08.013},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AkshayAOW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlipourGZP15,
author = {Sharareh Alipour and
Mohammad Ghodsi and
Alireza Zarei and
Maryam Pourreza},
title = {Visibility testing and counting},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {649--654},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.009},
doi = {10.1016/J.IPL.2015.03.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlipourGZP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlvesB15,
author = {Sandra Alves and
Sabine Broda},
title = {A short note on type-inhabitation: Formula-trees vs. game semantics},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {908--911},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.004},
doi = {10.1016/J.IPL.2015.05.004},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlvesB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlvesRSP15,
author = {P{\'{e}}ricles Rafael Oliveira Alves and
Raphael Ernani Rodrigues and
Rafael Martins de Souza and
Fernando Magno Quint{\~{a}}o Pereira},
title = {A case for a fast trip count predictor},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {146--150},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.008},
doi = {10.1016/J.IPL.2014.08.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlvesRSP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ArgiroffoLT15,
author = {Gabriela R. Argiroffo and
Valeria A. Leoni and
Pablo Daniel Torres},
title = {On the complexity of \{k\}-domination and k-tuple domination in graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {556--561},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.007},
doi = {10.1016/J.IPL.2015.01.007},
timestamp = {Mon, 23 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ArgiroffoLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AshokG15,
author = {Pradeesha Ashok and
Sathish Govindarajan},
title = {On strong centerpoints},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {431--434},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.004},
doi = {10.1016/J.IPL.2014.11.004},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AshokG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AvisT15,
author = {David Avis and
Hans Raj Tiwary},
title = {A generalization of extension complexity that captures {P}},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {588--593},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.005},
doi = {10.1016/J.IPL.2015.02.005},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AvisT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BadkobehC15,
author = {Golnaz Badkobeh and
Maxime Crochemore},
title = {Infinite binary words containing repetitions of odd period},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {543--547},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.004},
doi = {10.1016/J.IPL.2015.01.004},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BadkobehC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bang-JensenH15,
author = {J{\o}rgen Bang{-}Jensen and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Vertex coloring edge-weighted digraphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {791--796},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.007},
doi = {10.1016/J.IPL.2015.05.007},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bang-JensenH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BarguilB15,
author = {Joao M. M. Barguil and
Paulo S. L. M. Barreto},
title = {Security issues in Sarkar's e-cash protocol},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {801--803},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.007},
doi = {10.1016/J.IPL.2015.06.007},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BarguilB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BasinKZ15,
author = {David A. Basin and
Felix Klaedtke and
Eugen Zalinescu},
title = {Greedily computing associative aggregations on sliding windows},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {186--192},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.009},
doi = {10.1016/J.IPL.2014.09.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BasinKZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BenderTW15,
author = {Marco Bender and
Clemens Thielen and
Stephan Westphal},
title = {Packing items into several bins facilitates approximating the separable
assignment problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {570--575},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.001},
doi = {10.1016/J.IPL.2015.02.001},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BenderTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BerardCS15,
author = {B{\'{e}}atrice B{\'{e}}rard and
Krishnendu Chatterjee and
Nathalie Sznajder},
title = {Probabilistic opacity for Markov decision processes},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {52--59},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.001},
doi = {10.1016/J.IPL.2014.09.001},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BerardCS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BevernCHKTW15,
author = {Ren{\'{e}} van Bevern and
Jiehua Chen and
Falk H{\"{u}}ffner and
Stefan Kratsch and
Nimrod Talmon and
Gerhard J. Woeginger},
title = {Approximability and parameterized complexity of multicover by c-intervals},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {744--749},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.004},
doi = {10.1016/J.IPL.2015.03.004},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BevernCHKTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BiedlHHKP15,
author = {Therese Biedl and
Martin Held and
Stefan Huber and
Dominik Kaaser and
Peter Palfrader},
title = {A simple algorithm for computing positively weighted straight skeletons
of monotone polygons},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {243--247},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.021},
doi = {10.1016/J.IPL.2014.09.021},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BiedlHHKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BliznetsCKM15,
author = {Ivan Bliznets and
Marek Cygan and
Pawel Komosa and
Luk{\'{a}}s Mach},
title = {Kernelization lower bound for Permutation Pattern Matching},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {527--531},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.001},
doi = {10.1016/J.IPL.2015.01.001},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BliznetsCKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Blondeau15,
author = {C{\'{e}}line Blondeau},
title = {Impossible differential attack on 13-round Camellia-192},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {660--666},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.008},
doi = {10.1016/J.IPL.2015.03.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Blondeau15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BodlaenderK15,
author = {Hans L. Bodlaender and
Marc J. van Kreveld},
title = {Google Scholar makes it hard - the complexity of organizing one's
publications},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {965--968},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.003},
doi = {10.1016/J.IPL.2015.07.003},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BodlaenderK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BonomoDNV15,
author = {Flavia Bonomo and
Guillermo Dur{\'{a}}n and
Amedeo Napoli and
Mario Valencia{-}Pabon},
title = {A one-to-one correspondence between potential solutions of the cluster
deletion problem and the minimum sum coloring problem, and its application
to \{k\}-sparse graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {600--603},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.007},
doi = {10.1016/J.IPL.2015.02.007},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BonomoDNV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BragaSL15,
author = {Andrei Braga and
Cid C. de Souza and
Orlando Lee},
title = {The Eternal Dominating Set problem for proper interval graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {582--587},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.004},
doi = {10.1016/J.IPL.2015.02.004},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BragaSL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Brand15,
author = {Michael Brand},
title = {Arbitrary sequence RAMs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {193--198},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.010},
doi = {10.1016/J.IPL.2014.09.010},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Brand15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtFLM15,
author = {Andreas Brandst{\"{a}}dt and
Pavel Ficur and
Arne Leitert and
Martin Milanic},
title = {Polynomial-time algorithms for weighted efficient domination problems
in AT-free graphs and dually chordal graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {256--262},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.024},
doi = {10.1016/J.IPL.2014.09.024},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtFLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BrandstadtG15,
author = {Andreas Brandst{\"{a}}dt and
Vassilis Giakoumakis},
title = {Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free
graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {345--350},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.019},
doi = {10.1016/J.IPL.2014.09.019},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BrandstadtG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Branzei15,
author = {Simina Br{\^{a}}nzei},
title = {A note on envy-free cake cutting with polynomial valuations},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {93--95},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.005},
doi = {10.1016/J.IPL.2014.07.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Branzei15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BravermanOV15,
author = {Vladimir Braverman and
Rafail Ostrovsky and
Gregory Vorsanger},
title = {Weighted sampling without replacement from data streams},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {923--926},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.007},
doi = {10.1016/J.IPL.2015.07.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BravermanOV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BulteauFRV15,
author = {Laurent Bulteau and
Guillaume Fertin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
title = {Some algorithmic results for [2]-sumset covers},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {1--5},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.008},
doi = {10.1016/J.IPL.2014.07.008},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BulteauFRV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cai15,
author = {Junqing Cai},
title = {A sufficient condition involving implicit degree and neighborhood
intersection for long cycles},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {225--227},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.015},
doi = {10.1016/J.IPL.2014.09.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cai15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CenWY15,
author = {Yue{-}Feng Cen and
Wanliang Wang and
Xin{-}Wei Yao},
title = {A fast {CU} depth decision mechanism for {HEVC}},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {719--724},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.001},
doi = {10.1016/J.IPL.2015.04.001},
timestamp = {Thu, 06 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CenWY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChasseinG15,
author = {Andr{\'{e}} B. Chassein and
Marc Goerigk},
title = {Alternative formulations for the ordered weighted averaging objective},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {604--608},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.008},
doi = {10.1016/J.IPL.2015.02.008},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChasseinG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenF15,
author = {Xue{-}Gang Chen and
Shinya Fujita},
title = {Downhill domination problem in graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {580--581},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.003},
doi = {10.1016/J.IPL.2015.02.003},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenL15,
author = {Xiang'en Chen and
Zepeng Li},
title = {Adjacent-vertex-distinguishing proper edge colorings of planar bipartite
graphs with {\(\Delta\)} = 9, 10, or 11},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {263--268},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.025},
doi = {10.1016/J.IPL.2014.09.025},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenW15,
author = {Jing Chen and
Xiuping Wang},
title = {Identification of Hammerstein systems with continuous nonlinearity},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {822--827},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.004},
doi = {10.1016/J.IPL.2015.06.004},
timestamp = {Mon, 15 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChenW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenYH15,
author = {Taolue Chen and
Nengkun Yu and
Tingting Han},
title = {Continuous-time orbit problems are decidable in polynomial-time},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {11--14},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.004},
doi = {10.1016/J.IPL.2014.08.004},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenYH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengHF15,
author = {Dongqin Cheng and
Rong{-}Xia Hao and
Yan{-}Quan Feng},
title = {Embedding even cycles on folded hypercubes with conditional faulty
edges},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {945--949},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.015},
doi = {10.1016/J.IPL.2015.07.015},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChengHF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChoNPS15,
author = {Sukhyeun Cho and
Joong Chae Na and
Kunsoo Park and
Jeong Seop Sim},
title = {A fast algorithm for order-preserving pattern matching},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {397--402},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.018},
doi = {10.1016/J.IPL.2014.10.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChoNPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChungP15,
author = {Yerim Chung and
Myoung{-}Ju Park},
title = {Notes on inverse bin-packing problems},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {60--68},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.005},
doi = {10.1016/J.IPL.2014.09.005},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChungP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cohen0Y15,
author = {Reuven Cohen and
Liran Katzir and
Aviv Yehezkel},
title = {A unified scheme for generalizing cardinality estimators to sum aggregation},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {336--342},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.009},
doi = {10.1016/J.IPL.2014.10.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cohen0Y15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ConstantinouNKS15,
author = {Eleni Constantinou and
Athanasios Naskos and
George Kakarontzas and
Ioannis Stamelos},
title = {Extracting reusable components: {A} semi-automated approach for complex
structures},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {414--417},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.007},
doi = {10.1016/J.IPL.2014.11.007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ConstantinouNKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CourtieuRTU15,
author = {Pierre Courtieu and
Lionel Rieg and
S{\'{e}}bastien Tixeuil and
Xavier Urbain},
title = {Impossibility of gathering, a certification},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {447--452},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.001},
doi = {10.1016/J.IPL.2014.11.001},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CourtieuRTU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Croitoru15,
author = {Cosmina Croitoru},
title = {A note on quasi-kernels in digraphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {863--865},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.017},
doi = {10.1016/J.IPL.2015.06.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Croitoru15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Darnstadt15,
author = {Malte Darnst{\"{a}}dt},
title = {The optimal {PAC} bound for intersection-closed concept classes},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {458--461},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.12.001},
doi = {10.1016/J.IPL.2014.12.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Darnstadt15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasDKNS15,
author = {Gautam K. Das and
Minati De and
Sudeshna Kolay and
Subhas C. Nandy and
Susmita Sur{-}Kolay},
title = {Approximation algorithms for maximum independent set of a unit disk
graph},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {439--446},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.002},
doi = {10.1016/J.IPL.2014.11.002},
timestamp = {Wed, 31 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DasDKNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Datta15,
author = {Alak Kumar Datta},
title = {Approximate spanning cactus},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {828--832},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.009},
doi = {10.1016/J.IPL.2015.06.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Datta15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DebskiGS15,
author = {Michal Debski and
Jaroslaw Grytczuk and
Malgorzata Sleszynska{-}Nowak},
title = {The strong chromatic index of sparse graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {326--330},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.006},
doi = {10.1016/J.IPL.2014.10.006},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DebskiGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DehghanS15,
author = {Ali Dehghan and
Mohammad{-}Reza Sadeghi},
title = {The complexity of the zero-sum 3-flows},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {316--320},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.004},
doi = {10.1016/J.IPL.2014.10.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DehghanS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Diaconescu15,
author = {Razvan Diaconescu},
title = {On the existence of translations of structured specifications},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {15--22},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.007},
doi = {10.1016/J.IPL.2014.08.007},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Diaconescu15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DietzfelbingerJ15,
author = {Martin Dietzfelbinger and
Raed Jaberi},
title = {On testing single connectedness in directed graphs and some related
problems},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {684--688},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.008},
doi = {10.1016/J.IPL.2015.04.008},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DietzfelbingerJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DongJZHL15,
author = {Jianming Dong and
Yiwei Jiang and
An Zhang and
Jueliang Hu and
Hui Luo},
title = {An approximation algorithm for proportionate scheduling in the two-stage
hybrid flow shop},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {475--480},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.014},
doi = {10.1016/J.IPL.2014.11.014},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DongJZHL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DongZA15,
author = {Qiang Dong and
Qian Zhao and
Ya{-}Hui An},
title = {The hamiltonicity of generalized honeycomb torus networks},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {104--111},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.011},
doi = {10.1016/J.IPL.2014.07.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DongZA15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DoronT15,
author = {Dean Doron and
Amnon Ta{-}Shma},
title = {On the de-randomization of space-bounded approximate counting problems},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {750--753},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.005},
doi = {10.1016/J.IPL.2015.03.005},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DoronT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DugarJRB15,
author = {Chetan Dugar and
Anuj Jain and
Amit Rajawat and
Swapan Bhattacharya},
title = {Dynamic pricing of call rates: Bayesian approach},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {237--242},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.020},
doi = {10.1016/J.IPL.2014.09.020},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DugarJRB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EisenbarthMS15,
author = {Thomas Eisenbarth and
Aaron Meyerowitz and
Rainer Steinwandt},
title = {On the security margin of {MAC} striping},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {899--902},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.009},
doi = {10.1016/J.IPL.2015.05.009},
timestamp = {Fri, 08 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/EisenbarthMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Elmasry15,
author = {Amr Elmasry},
title = {Counting inversions adaptively},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {769--772},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.003},
doi = {10.1016/J.IPL.2015.05.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Elmasry15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EnosZ15,
author = {Graham Enos and
Yuliang Zheng},
title = {An ID-based signcryption scheme with compartmented secret sharing
for unsigncryption},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {128--133},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.002},
doi = {10.1016/J.IPL.2014.08.002},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/EnosZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FeldmanT15,
author = {Michal Feldman and
Tami Tamir},
title = {Convergence of best-response dynamics in games with conflicting congestion
effects},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {112--118},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.012},
doi = {10.1016/J.IPL.2014.07.012},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FeldmanT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FernauHHMS15,
author = {Henning Fernau and
Pinar Heggernes and
Pim van 't Hof and
Daniel Meister and
Reza Saei},
title = {Computing the metric dimension for chain graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {671--676},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.006},
doi = {10.1016/J.IPL.2015.04.006},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FernauHHMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Finkel15,
author = {Olivier Finkel},
title = {The exact complexity of the infinite Post Correspondence Problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {609--611},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.009},
doi = {10.1016/J.IPL.2015.02.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Finkel15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FloderusLPS15,
author = {Peter Floderus and
Andrzej Lingas and
Mia Persson and
Dzmitry Sledneu},
title = {Detecting monomials with k distinct variables},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {82--86},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.003},
doi = {10.1016/J.IPL.2014.07.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FloderusLPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FlouriGKU15,
author = {Tom{\'{a}}s Flouri and
Emanuele Giaquinta and
Kassian Kobert and
Esko Ukkonen},
title = {Longest common substrings with k mismatches},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {643--647},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.006},
doi = {10.1016/J.IPL.2015.03.006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FlouriGKU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FournierIV15,
author = {Herv{\'{e}} Fournier and
Anas Ismail and
Antoine Vigneron},
title = {Computing the Gromov hyperbolicity of a discrete metric space},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {576--579},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.002},
doi = {10.1016/J.IPL.2015.02.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FournierIV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GaoL15,
author = {Xiaofang Gao and
Jiye Liang},
title = {An improved incremental nonlinear dimensionality reduction for isometric
data embedding},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {492--501},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.12.004},
doi = {10.1016/J.IPL.2014.12.004},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GaoL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GathenS15,
author = {Joachim von zur Gathen and
Igor E. Shparlinski},
title = {Circulant graphs and {GCD} and {LCM} of subsets},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {134--138},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.014},
doi = {10.1016/J.IPL.2014.07.014},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GathenS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GavalasKMPV15,
author = {Damianos Gavalas and
Charalampos Konstantopoulos and
Konstantinos Mastakas and
Grammati E. Pantziou and
Nikolaos Vathis},
title = {Approximation algorithms for the arc orienteering problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {313--315},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.003},
doi = {10.1016/J.IPL.2014.10.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GavalasKMPV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GelernterH15,
author = {Nethanel Gelernter and
Amir Herzberg},
title = {Gossip Latin square and the meet-all gossipers problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {738--743},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.001},
doi = {10.1016/J.IPL.2015.03.001},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GelernterH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GengY15,
author = {Zhichao Geng and
Jinjiang Yuan},
title = {A note on unbounded parallel-batch scheduling},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {969--974},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.002},
doi = {10.1016/J.IPL.2015.07.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GengY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GerstlMM15,
author = {Enrique Gerstl and
Baruch Mor and
Gur Mosheiov},
title = {A note: Maximizing the weighted number of just-in-time jobs on a proportionate
flowshop},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {159--162},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.004},
doi = {10.1016/J.IPL.2014.09.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GerstlMM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gorain015,
author = {Barun Gorain and
Partha Sarathi Mandal},
title = {Approximation algorithm for sweep coverage on graph},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {712--718},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.011},
doi = {10.1016/J.IPL.2015.03.011},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gorain015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gourves15,
author = {Laurent Gourv{\`{e}}s},
title = {Approximating the optimal sequence of acquisitions and sales with
a capped budget},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {760--764},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.001},
doi = {10.1016/J.IPL.2015.05.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gourves15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Grabowski15,
author = {Szymon Grabowski},
title = {A note on the longest common substring with k-mismatches problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {640--642},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.003},
doi = {10.1016/J.IPL.2015.03.003},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Grabowski15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrandoniKW15,
author = {Fabrizio Grandoni and
Tomasz Kociumaka and
Michal Wlodarczyk},
title = {An LP-rounding 2{\(\surd\)}2-approximation for restricted maximum
acyclic subgraph},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {182--185},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.008},
doi = {10.1016/J.IPL.2014.09.008},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GrandoniKW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Grolmusz15,
author = {Vince Grolmusz},
title = {A note on the PageRank of undirected graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {633--634},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.015},
doi = {10.1016/J.IPL.2015.02.015},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Grolmusz15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrzegorekJ15,
author = {Paulina Grzegorek and
Janusz Januszewski},
title = {A note on one-space bounded square packing},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {872--876},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.001},
doi = {10.1016/J.IPL.2015.06.001},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrzegorekJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoHC15,
author = {Jing{-}Ming Guo and
Chih{-}Hsien Hsia and
Chia{-}Hao Chang},
title = {{JPEG} false contour reduction using error diffusion},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {403--407},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.011},
doi = {10.1016/J.IPL.2014.11.011},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuoHC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoSY15,
author = {Jian Guo and
Chunhua Su and
Wun{-}She Yap},
title = {An improved preimage attack against {HAVAL-3}},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {386--393},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.016},
doi = {10.1016/J.IPL.2014.10.016},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuoSY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GuoZM15,
author = {Zhiwei Guo and
Haixing Zhao and
Yaping Mao},
title = {The equitable vertex arboricity of complete tripartite graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {977--982},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.016},
doi = {10.1016/J.IPL.2015.06.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GuoZM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HaddadiCCG15,
author = {Salim Haddadi and
S. Chenche and
Meryem Cheraitia and
F. Guessoum},
title = {Polynomial-time local-improvement algorithm for Consecutive Block
Minimization},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {612--617},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.010},
doi = {10.1016/J.IPL.2015.02.010},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HaddadiCCG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HarnH15,
author = {Lein Harn and
Ching{-}Fang Hsu},
title = {Dynamic threshold secret reconstruction and its application to the
threshold cryptography},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {851--857},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.014},
doi = {10.1016/J.IPL.2015.06.014},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HarnH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HirschS15,
author = {Edward A. Hirsch and
Dmitry Sokolov},
title = {On the probabilistic closure of the loose unambiguous hierarchy},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {725--730},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.010},
doi = {10.1016/J.IPL.2015.04.010},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HirschS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HonkalaHL15,
author = {Iiro S. Honkala and
Olivier Hudry and
Antoine Lobstein},
title = {On the ensemble of optimal dominating and locating-dominating codes
in a graph},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {699--702},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.005},
doi = {10.1016/J.IPL.2015.04.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HonkalaHL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HuangYGZ15,
author = {Sheng Huang and
Dan Yang and
Yongxin Ge and
Xiaohong Zhang},
title = {Combined supervised information with {PCA} via discriminative component
selection},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {812--816},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.010},
doi = {10.1016/J.IPL.2015.06.010},
timestamp = {Fri, 29 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HuangYGZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HungCWH15,
author = {Chun{-}Nan Hung and
Eddie Cheng and
Tao{-}Ming Wang and
Lih{-}Hsing Hsu},
title = {On Hamiltonian properties of unidirectional hypercubes},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {551--555},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.006},
doi = {10.1016/J.IPL.2015.01.006},
timestamp = {Sat, 01 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HungCWH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IanniGR15,
author = {Miriam Di Ianni and
Luciano Gual{\`{a}} and
Gianluca Rossi},
title = {Reducing the diameter of a unit disk graph via node addition},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {845--850},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.015},
doi = {10.1016/J.IPL.2015.06.015},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IanniGR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IdalinoMCP15,
author = {Tha{\'{\i}}s Bardini Idalino and
Lucia Moura and
Ricardo Felipe Cust{\'{o}}dio and
Daniel Panario},
title = {Locating modifications in signed data for partial data integrity},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {731--737},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.014},
doi = {10.1016/J.IPL.2015.02.014},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IdalinoMCP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ImaiK15,
author = {Shigeyoshi Imai and
Kaoru Kurosawa},
title = {Improved reconstruction of {RSA} private-keys from their fraction},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {630--632},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.013},
doi = {10.1016/J.IPL.2015.02.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ImaiK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Indrzejczak15,
author = {Andrzej Indrzejczak},
title = {Eliminability of cut in hypersequent calculi for some modal logics
of linear frames},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {75--81},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.002},
doi = {10.1016/J.IPL.2014.07.002},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Indrzejczak15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IshiuK15,
author = {Tetsuya Ishiu and
Masashi Kikuchi},
title = {The termination of the higher-dimensional tarai functions},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {125--127},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.001},
doi = {10.1016/J.IPL.2014.08.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IshiuK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JaiswalKY15,
author = {Ragesh Jaiswal and
Mehul Kumar and
Pulkit Yadav},
title = {Improved analysis of D\({}^{\mbox{2}}\)-sampling based {PTAS} for
k-means and other clustering problems},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {100--103},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.009},
doi = {10.1016/J.IPL.2014.07.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JaiswalKY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JanczewskiT15,
author = {Robert Janczewski and
Krzysztof Turowski},
title = {The computational complexity of the backbone coloring problem for
bounded-degree graphs with connected backbones},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {232--236},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.018},
doi = {10.1016/J.IPL.2014.09.018},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JanczewskiT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JannatiF15,
author = {Hoda Jannati and
Abolfazl Falahati},
title = {Analysis of false-reject probability in distance bounding protocols
with mixed challenges over {RFID} noisy communication channel},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {623--629},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.012},
doi = {10.1016/J.IPL.2015.02.012},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JannatiF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jha15,
author = {Pranava K. Jha},
title = {A comment on "The domination number of exchanged hypercubes"},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {343--344},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.016},
doi = {10.1016/J.IPL.2014.09.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jha15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JiaSZC15,
author = {Tong Jia and
Yan Shi and
ZhongXuan Zhou and
Dongyue Chen},
title = {3D depth information extraction with omni-directional camera},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {285--291},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.029},
doi = {10.1016/J.IPL.2014.09.029},
timestamp = {Thu, 26 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JiaSZC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JourdanUY15,
author = {Guy{-}Vincent Jourdan and
Hasan Ural and
H{\"{u}}sn{\"{u}} Yenig{\"{u}}n},
title = {Reduced checking sequences using unreliable reset},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {532--535},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.002},
doi = {10.1016/J.IPL.2015.01.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JourdanUY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KaiserSC15,
author = {Tom{\'{a}}s Kaiser and
Maria Saumell and
Nico Van Cleemput},
title = {10-Gabriel graphs are Hamiltonian},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {877--881},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.013},
doi = {10.1016/J.IPL.2015.05.013},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KaiserSC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kakugawa15,
author = {Hirotsugu Kakugawa},
title = {On the family of critical section problems},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {28--32},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.08.012},
doi = {10.1016/J.IPL.2014.08.012},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Kakugawa15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kakugawa15a,
author = {Hirotsugu Kakugawa},
title = {Self-stabilizing distributed algorithm for local mutual inclusion},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {562--569},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.008},
doi = {10.1016/J.IPL.2015.01.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kakugawa15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KamiyamaK15,
author = {Naoyuki Kamiyama and
Yasushi Kawase},
title = {On packing arborescences in temporal networks},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {321--325},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.005},
doi = {10.1016/J.IPL.2014.10.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KamiyamaK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KarakocDH15,
author = {Ferhat Karako{\c{c}} and
H{\"{u}}seyin Demirci and
A. Emre Harmanci},
title = {{AKF:} {A} key alternating Feistel scheme for lightweight cipher designs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {359--367},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.010},
doi = {10.1016/J.IPL.2014.10.010},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KarakocDH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KarandikarKS15,
author = {Prateek Karandikar and
Manfred Kufleitner and
Philippe Schnoebelen},
title = {On the index of Simon's congruence for piecewise testability},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {515--519},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.008},
doi = {10.1016/J.IPL.2014.11.008},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KarandikarKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KiralyK15,
author = {Zolt{\'{a}}n Kir{\'{a}}ly and
Erika R. Kov{\'{a}}cs},
title = {Randomized and deterministic algorithms for network coding problems
in wireless networks},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {507--511},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.012},
doi = {10.1016/J.IPL.2014.11.012},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KiralyK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kobayashi15,
author = {Yasuaki Kobayashi},
title = {Computing the pathwidth of directed graphs with small vertex cover},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {310--312},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.002},
doi = {10.1016/J.IPL.2014.10.002},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kobayashi15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KovacsMMN15,
author = {Annam{\'{a}}ria Kov{\'{a}}cs and
Ulrich Meyer and
Gabriel Moruz and
Andrei Negoescu},
title = {The optimal structure of algorithms for {\(\alpha\)}-paging},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {932--938},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.011},
doi = {10.1016/J.IPL.2015.07.011},
timestamp = {Tue, 25 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KovacsMMN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LadinekZ15,
author = {Irena Hrastnik Ladinek and
Janez Zerovnik},
title = {Perfect codes in direct graph bundles},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {707--711},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.010},
doi = {10.1016/J.IPL.2015.03.010},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LadinekZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LambertMU15,
author = {Thomas Lambert and
Loris Marchal and
Bora U{\c{c}}ar},
title = {Comments on the hierarchically structured bin packing problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {306--309},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.001},
doi = {10.1016/J.IPL.2014.10.001},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LambertMU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Li15,
author = {Mengjun Li},
title = {Automatic proving or disproving equality loop invariants based on
finite difference techniques},
journal = {Inf. Process. Lett.},
volume = {115},
number = {4},
pages = {468--474},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.006},
doi = {10.1016/J.IPL.2014.11.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Li15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiSZX15,
author = {Zepeng Li and
Zehui Shao and
Enqiang Zhu and
Jin Xu},
title = {A note on local coloring of graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {302--305},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.032},
doi = {10.1016/J.IPL.2014.09.032},
timestamp = {Wed, 08 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiSZX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiangS15,
author = {Zuosong Liang and
Erfang Shan},
title = {The clique-transversal set problem in claw-free graphs with degree
at most 4},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {331--335},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.008},
doi = {10.1016/J.IPL.2014.10.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiangS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LienKF15,
author = {Min{-}Yun Lien and
Jyhmin Kuo and
Hung{-}Lin Fu},
title = {On the decycling number of generalized Kautz digraphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {209--211},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.013},
doi = {10.1016/J.IPL.2014.09.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LienKF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LinLW15,
author = {Chiou{-}Jiun Lin and
Jia Jie Liu and
Yue{-}Li Wang},
title = {Finding outer-connected dominating sets in interval graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {917--922},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.008},
doi = {10.1016/J.IPL.2015.07.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LinLW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-18 12:52 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:
