default search action
Search dblp for Publications
export results for "toc:db/journals/ipl/ipl132.bht:"
@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/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/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/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/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/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/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/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/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/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/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} }
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.