Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jal/jal52.bht:"
@article{DBLP:journals/jal/AlberF04, author = {Jochen Alber and Jir{\'{\i}} Fiala}, title = {Geometric separation and exact solutions for the parameterized independent set problem on disk graphs}, journal = {J. Algorithms}, volume = {52}, number = {2}, pages = {134--151}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2003.10.001}, doi = {10.1016/J.JALGOR.2003.10.001}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/AlberF04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/AlberFN04, author = {Jochen Alber and Henning Fernau and Rolf Niedermeier}, title = {Parameterized complexity: exponential speed-up for planar graph problems}, journal = {J. Algorithms}, volume = {52}, number = {1}, pages = {26--56}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2004.03.005}, doi = {10.1016/J.JALGOR.2004.03.005}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/AlberFN04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/AndrewsZ04, author = {Matthew Andrews and Lisa Zhang}, title = {Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule}, journal = {J. Algorithms}, volume = {52}, number = {1}, pages = {57--81}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2004.03.004}, doi = {10.1016/J.JALGOR.2004.03.004}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/AndrewsZ04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/AzarERW04, author = {Yossi Azar and Leah Epstein and Yossi Richter and Gerhard J. Woeginger}, title = {All-norm approximation algorithms}, journal = {J. Algorithms}, volume = {52}, number = {2}, pages = {120--133}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2004.02.003}, doi = {10.1016/J.JALGOR.2004.02.003}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/AzarERW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/BoyarKN04, author = {Joan Boyar and Susan Krarup and Morten N. Nielsen}, title = {Seat reservation allowing seat changes}, journal = {J. Algorithms}, volume = {52}, number = {2}, pages = {169--192}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2004.02.002}, doi = {10.1016/J.JALGOR.2004.02.002}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/BoyarKN04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/ElkinK04, author = {Michael Elkin and Guy Kortsarz}, title = {Logarithmic inapproximability of the radio broadcast problem}, journal = {J. Algorithms}, volume = {52}, number = {1}, pages = {8--25}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2003.11.004}, doi = {10.1016/J.JALGOR.2003.11.004}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/ElkinK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/EllisFF04, author = {John A. Ellis and Hongbing Fan and Michael R. Fellows}, title = {The dominating set problem is fixed parameter tractable for graphs of bounded genus}, journal = {J. Algorithms}, volume = {52}, number = {2}, pages = {152--168}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2004.02.001}, doi = {10.1016/J.JALGOR.2004.02.001}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/EllisFF04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/Elmasry04, author = {Amr Elmasry}, title = {Parameterized self-adjusting heaps}, journal = {J. Algorithms}, volume = {52}, number = {2}, pages = {103--119}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2004.03.002}, doi = {10.1016/J.JALGOR.2004.03.002}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/Elmasry04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/FlaxmanFU04, author = {Abraham Flaxman and Alan M. Frieze and Eli Upfal}, title = {Efficient communication in an ad-hoc network}, journal = {J. Algorithms}, volume = {52}, number = {1}, pages = {1--7}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2004.01.004}, doi = {10.1016/J.JALGOR.2004.01.004}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/FlaxmanFU04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/LamNT04, author = {Tak Wah Lam and Tsuen{-}Wan Ngan and Kar{-}Keung To}, title = {Performance guarantee for {EDF} under overload}, journal = {J. Algorithms}, volume = {52}, number = {2}, pages = {193--206}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2003.10.004}, doi = {10.1016/J.JALGOR.2003.10.004}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/LamNT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/WangLK04, author = {Biing{-}Feng Wang and Jyh{-}Jye Lin and Shan{-}Chyun Ku}, title = {Efficient algorithms for the scaled indexing problem}, journal = {J. Algorithms}, volume = {52}, number = {1}, pages = {82--100}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2004.03.006}, doi = {10.1016/J.JALGOR.2004.03.006}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/WangLK04.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.