Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jal/jal47.bht:"
@article{DBLP:journals/jal/AlexanderBW03, author = {David L. J. Alexander and David W. Bulger and Graham R. Wood}, title = {Expected search duration for finite backtracking adaptive search}, journal = {J. Algorithms}, volume = {47}, number = {2}, pages = {78--86}, year = {2003}, url = {https://doi.org/10.1016/S0196-6774(03)00018-X}, doi = {10.1016/S0196-6774(03)00018-X}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/AlexanderBW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/AlonS03, author = {Noga Alon and Asaf Shapira}, title = {Testing satisfiability}, journal = {J. Algorithms}, volume = {47}, number = {2}, pages = {87--103}, year = {2003}, url = {https://doi.org/10.1016/S0196-6774(03)00019-1}, doi = {10.1016/S0196-6774(03)00019-1}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/AlonS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/BahigN03, author = {Hatem M. Bahig and Ken Nakamula}, title = {Erratum to "Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true": {[J.} Algorithms 42 {(2002)} 304-316]}, journal = {J. Algorithms}, volume = {47}, number = {1}, pages = {60--61}, year = {2003}, url = {https://doi.org/10.1016/S0196-6774(03)00016-6}, doi = {10.1016/S0196-6774(03)00016-6}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/BahigN03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/BermanDM03, author = {Piotr Berman and Bhaskar DasGupta and S. Muthukrishnan}, title = {Approximation algorithms for {MAX-MIN} tiling}, journal = {J. Algorithms}, volume = {47}, number = {2}, pages = {122--134}, year = {2003}, url = {https://doi.org/10.1016/S0196-6774(03)00015-4}, doi = {10.1016/S0196-6774(03)00015-4}, timestamp = {Mon, 10 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/BermanDM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/DengLZZ03, author = {Xiaotie Deng and Guojun Li and Wenan Zang and Yi Zhou}, title = {A 2-approximation algorithm for path coloring on a restricted class of trees of rings}, journal = {J. Algorithms}, volume = {47}, number = {1}, pages = {1--13}, year = {2003}, url = {https://doi.org/10.1016/S0196-6774(03)00003-8}, doi = {10.1016/S0196-6774(03)00003-8}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/DengLZZ03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/IturriagaL03, author = {Claudia Iturriaga and Anna Lubiw}, title = {Elastic labels around the perimeter of a map}, journal = {J. Algorithms}, volume = {47}, number = {1}, pages = {14--39}, year = {2003}, url = {https://doi.org/10.1016/S0196-6774(03)00004-X}, doi = {10.1016/S0196-6774(03)00004-X}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/IturriagaL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/NiedermeierR03, author = {Rolf Niedermeier and Peter Rossmanith}, title = {On efficient fixed-parameter algorithms for weighted vertex cover}, journal = {J. Algorithms}, volume = {47}, number = {2}, pages = {63--77}, year = {2003}, url = {https://doi.org/10.1016/S0196-6774(03)00005-1}, doi = {10.1016/S0196-6774(03)00005-1}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/NiedermeierR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/Skodinis03, author = {Konstantin Skodinis}, title = {Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time}, journal = {J. Algorithms}, volume = {47}, number = {1}, pages = {40--59}, year = {2003}, url = {https://doi.org/10.1016/S0196-6774(02)00225-0}, doi = {10.1016/S0196-6774(02)00225-0}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/Skodinis03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/Tsaban03, author = {Boaz Tsaban}, title = {Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation}, journal = {J. Algorithms}, volume = {47}, number = {2}, pages = {104--121}, year = {2003}, url = {https://doi.org/10.1016/S0196-6774(03)00017-8}, doi = {10.1016/S0196-6774(03)00017-8}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/Tsaban03.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.