Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jal/jal41.bht:"
@article{DBLP:journals/jal/AlborziTUW01, author = {Houman Alborzi and Eric Torng and Patchrawat Uthaisombut and Stephen Wagner}, title = {The k-Client Problem}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {115--173}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1182}, doi = {10.1006/JAGM.2001.1182}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/AlborziTUW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/Bang-JensenY01, author = {J{\o}rgen Bang{-}Jensen and Anders Yeo}, title = {The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs}, journal = {J. Algorithms}, volume = {41}, number = {1}, pages = {1--19}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1174}, doi = {10.1006/JAGM.2001.1174}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/Bang-JensenY01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/BermanDMR01, author = {Piotr Berman and Bhaskar DasGupta and S. Muthukrishnan and Suneeta Ramaswami}, title = {Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {443--470}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1188}, doi = {10.1006/JAGM.2001.1188}, timestamp = {Mon, 10 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/BermanDMR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/Cary01, author = {Matthew Cary}, title = {Toward Optimal epsilon-Approximate Nearest Neighbor Algorithms}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {417--428}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1193}, doi = {10.1006/JAGM.2001.1193}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/Cary01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/ChanE01, author = {Timothy M. Chan and Alon Efrat}, title = {Fly Cheaply: On the Minimum Fuel Consumption Problem}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {330--337}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1189}, doi = {10.1006/JAGM.2001.1189}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/ChanE01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/ChaudharyV01, author = {Amitabh Chaudhary and Sundar Vishwanathan}, title = {Approximation Algorithms for the Achromatic Number}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {404--416}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1192}, doi = {10.1006/JAGM.2001.1192}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/ChaudharyV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/ChekuriB01, author = {Chandra Chekuri and Michael A. Bender}, title = {An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {212--224}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1184}, doi = {10.1006/JAGM.2001.1184}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/ChekuriB01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/Chen01a, author = {Zhi{-}Zhong Chen}, title = {Approximation Algorithms for Independent Sets in Map Graphs}, journal = {J. Algorithms}, volume = {41}, number = {1}, pages = {20--40}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1178}, doi = {10.1006/JAGM.2001.1178}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/Chen01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/ChenKJ01, author = {Jianer Chen and Iyad A. Kanj and Weijia Jia}, title = {Vertex Cover: Further Observations and Further Improvements}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {280--301}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1186}, doi = {10.1006/JAGM.2001.1186}, timestamp = {Mon, 23 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/ChenKJ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/DahlhausGM01, author = {Elias Dahlhaus and Jens Gustedt and Ross M. McConnell}, title = {Efficient and Practical Algorithms for Sequential Modular Decomposition}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {360--387}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1185}, doi = {10.1006/JAGM.2001.1185}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/DahlhausGM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/DawandeKST01, author = {Milind Dawande and Pinar Keskinocak and Jayashankar M. Swaminathan and Sridhar R. Tayur}, title = {On Bipartite and Multipartite Clique Problems}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {388--403}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1199}, doi = {10.1006/JAGM.2001.1199}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/DawandeKST01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/FeigeL01, author = {Uriel Feige and Michael Langberg}, title = {Approximation Algorithms for Maximization Problems Arising in Graph Partitioning}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {174--211}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1183}, doi = {10.1006/JAGM.2001.1183}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/FeigeL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/GoldbergGPPSS01, author = {Leslie Ann Goldberg and Paul W. Goldberg and Mike Paterson and Pavel A. Pevzner and S{\"{u}}leyman Cenk Sahinalp and Elizabeth Sweedyk}, title = {The Complexity of Gene Placement}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {225--243}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1172}, doi = {10.1006/JAGM.2001.1172}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/GoldbergGPPSS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/HagerupMP01, author = {Torben Hagerup and Peter Bro Miltersen and Rasmus Pagh}, title = {Deterministic Dictionaries}, journal = {J. Algorithms}, volume = {41}, number = {1}, pages = {69--85}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1171}, doi = {10.1006/JAGM.2001.1171}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/HagerupMP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/HassinK01, author = {Refael Hassin and Samir Khuller}, title = {z-Approximations}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {429--442}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1187}, doi = {10.1006/JAGM.2001.1187}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/HassinK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/IwamaM01a, author = {Kazuo Iwama and Eiji Miyano}, title = {An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {262--279}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1176}, doi = {10.1006/JAGM.2001.1176}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/IwamaM01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/JeronimoPS01, author = {Gabriela Jeronimo and Susana Puddu and Juan Sabia}, title = {Computing Chow Forms and Some Applications}, journal = {J. Algorithms}, volume = {41}, number = {1}, pages = {52--68}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1177}, doi = {10.1006/JAGM.2001.1177}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/JeronimoPS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/KrivelevichNS01, author = {Michael Krivelevich and Ram Nathaniel and Benny Sudakov}, title = {Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs}, journal = {J. Algorithms}, volume = {41}, number = {1}, pages = {99--113}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1173}, doi = {10.1006/JAGM.2001.1173}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/KrivelevichNS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/LandauZ01, author = {Gad M. Landau and Michal Ziv{-}Ukelson}, title = {On the Common Substring Alignment Problem}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {338--359}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1191}, doi = {10.1006/JAGM.2001.1191}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/LandauZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/LingasOO01, author = {Andrzej Lingas and Hans Olsson and Anna {\"{O}}stlin}, title = {Efficient Merging and Construction of Evolutionary Trees}, journal = {J. Algorithms}, volume = {41}, number = {1}, pages = {41--51}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1168}, doi = {10.1006/JAGM.2001.1168}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/LingasOO01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/NichitiuMR01, author = {Codrin M. Nichitiu and Jacques Mazoyer and Eric R{\'{e}}mila}, title = {Algorithms for Leader Election by Cellular Automata}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {302--329}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1175}, doi = {10.1006/JAGM.2001.1175}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/NichitiuMR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/SandersS01, author = {Peter Sanders and Roberto Solis{-}Oba}, title = {How Helpers Hasten h-Relations}, journal = {J. Algorithms}, volume = {41}, number = {1}, pages = {86--98}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1169}, doi = {10.1006/JAGM.2001.1169}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/SandersS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/Winkler01, author = {Peter Winkler}, title = {Optimality and Greed in Dynamic Allocation}, journal = {J. Algorithms}, volume = {41}, number = {2}, pages = {244--261}, year = {2001}, url = {https://doi.org/10.1006/jagm.2001.1198}, doi = {10.1006/JAGM.2001.1198}, timestamp = {Mon, 23 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/Winkler01.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.