Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/ipl/ipl135.bht:"
@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 = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AichholzerADMFP18.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/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/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/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/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/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/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/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/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/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/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/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/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/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} }
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.