default search action
Search dblp for Publications
export results for "toc:db/journals/jda/jda22.bht:"
@article{DBLP:journals/jda/BazganGM13, author = {Cristina Bazgan and Laurent Gourv{\`{e}}s and J{\'{e}}r{\^{o}}me Monnot}, title = {Approximation with a fixed number of solutions of some multiobjective maximization problems}, journal = {J. Discrete Algorithms}, volume = {22}, pages = {19--29}, year = {2013}, url = {https://doi.org/10.1016/j.jda.2013.06.006}, doi = {10.1016/J.JDA.2013.06.006}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BazganGM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/BelazzouguiKR13, author = {Djamal Belazzougui and Roman Kolpakov and Mathieu Raffinot}, title = {Various improvements to text fingerprinting}, journal = {J. Discrete Algorithms}, volume = {22}, pages = {1--18}, year = {2013}, url = {https://doi.org/10.1016/j.jda.2013.06.004}, doi = {10.1016/J.JDA.2013.06.004}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BelazzouguiKR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/BoriaBEP13, author = {Nicolas Boria and Nicolas Bourgeois and Bruno Escoffier and Vangelis Th. Paschos}, title = {Exponential approximation schemata for some network design problems}, journal = {J. Discrete Algorithms}, volume = {22}, pages = {43--52}, year = {2013}, url = {https://doi.org/10.1016/j.jda.2013.06.011}, doi = {10.1016/J.JDA.2013.06.011}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BoriaBEP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CarmiC13, author = {Paz Carmi and Lilach Chaitman{-}Yerushalmi}, title = {Minimum weight Euclidean t-spanner is NP-hard}, journal = {J. Discrete Algorithms}, volume = {22}, pages = {30--42}, year = {2013}, url = {https://doi.org/10.1016/j.jda.2013.06.010}, doi = {10.1016/J.JDA.2013.06.010}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CarmiC13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/IndhumathiC13, author = {Indhumathi Raman and Sheshayya A. Choudum}, title = {Embedding certain height-balanced trees and complete \emph{p}\({}^{\mbox{\emph{m}}}\)-ary trees into hypercubes}, journal = {J. Discrete Algorithms}, volume = {22}, pages = {53--65}, year = {2013}, url = {https://doi.org/10.1016/j.jda.2013.07.005}, doi = {10.1016/J.JDA.2013.07.005}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/IndhumathiC13.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.