Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jea/jea14.bht:"
@article{DBLP:journals/jea/AvdilW09, author = {Alaubek Avdil and Karsten Weihe}, title = {Local search starting from an {LP} solution: Fast and quite good}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1594877}, doi = {10.1145/1498698.1594877}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/AvdilW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/BarbayLLS09, author = {J{\'{e}}r{\'{e}}my Barbay and Alejandro L{\'{o}}pez{-}Ortiz and Tyler Lu and Alejandro Salinger}, title = {An experimental investigation of set intersection algorithms for text searching}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1564507}, doi = {10.1145/1498698.1564507}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/BarbayLLS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/BasuMS09, author = {Amitabh Basu and Joseph S. B. Mitchell and Girishkumar Sabhnani}, title = {Geometric algorithms for optimal airspace design and air traffic controller workload balancing}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1537598}, doi = {10.1145/1498698.1537598}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/BasuMS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/BauerD09, author = {Reinhard Bauer and Daniel Delling}, title = {{SHARC:} Fast and robust unidirectional routing}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1537599}, doi = {10.1145/1498698.1537599}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/BauerD09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/CedermanT09, author = {Daniel Cederman and Philippas Tsigas}, title = {GPU-Quicksort: {A} practical Quicksort algorithm for graphics processors}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1564500}, doi = {10.1145/1498698.1564500}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/CedermanT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/CherkasskyGGTW09, author = {Boris V. Cherkassky and Loukas Georgiadis and Andrew V. Goldberg and Robert Endre Tarjan and Renato Fonseca F. Werneck}, title = {Shortest-path feasibility algorithms: An experimental evaluation}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1537602}, doi = {10.1145/1498698.1537602}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/CherkasskyGGTW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/ChimaniGM09, author = {Markus Chimani and Carsten Gutwenger and Petra Mutzel}, title = {Experiments on exact crossing minimization using column generation}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1564504}, doi = {10.1145/1498698.1564504}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/ChimaniGM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/ChimaniKLM09, author = {Markus Chimani and Maria Kandyba and Ivana Ljubic and Petra Mutzel}, title = {Obtaining optimal \emph{k}-cardinality trees fast}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1537600}, doi = {10.1145/1498698.1537600}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/ChimaniKLM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/ColemanW09, author = {Tom Coleman and Anthony Wirth}, title = {Ranking tournaments: Local search and a new algorithm}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1537601}, doi = {10.1145/1498698.1537601}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/ColemanW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/DeinekoT09, author = {Vladimir G. Deineko and Alexander Tiskin}, title = {Fast minimum-weight double-tree shortcutting for metric {TSP:} Is the best one good enough?}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1594232}, doi = {10.1145/1498698.1594232}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/DeinekoT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/Demetrescu09, author = {Camil Demetrescu}, title = {Preface}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1594227}, doi = {10.1145/1498698.1594227}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/Demetrescu09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/DumitriuFKM09, author = {Daniel Dumitriu and Stefan Funke and Martin Kutz and Nikola Milosavljevic}, title = {How much geometry it takes to reconstruct a 2-manifold in R\({}^{\mbox{3}}\)}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1537597}, doi = {10.1145/1498698.1537597}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/DumitriuFKM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/EisenbrandKX09, author = {Friedrich Eisenbrand and Andreas Karrenbauer and Chihao Xu}, title = {Algorithms for longer {OLED} lifetime}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1594229}, doi = {10.1145/1498698.1594229}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/EisenbrandKX09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/EnglertRW09, author = {Matthias Englert and Heiko R{\"{o}}glin and Matthias Westermann}, title = {Evaluation of online strategies for reordering buffers}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1564503}, doi = {10.1145/1498698.1564503}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/EnglertRW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/Estivill-CastroHS09, author = {Vladimir Estivill{-}Castro and Apichat Heednacram and Francis Suraweera}, title = {Reduction rules deliver efficient FPT-algorithms for covering points with lines}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1626535}, doi = {10.1145/1498698.1626535}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/Estivill-CastroHS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/FarshiG09, author = {Mohammad Farshi and Joachim Gudmundsson}, title = {Experimental study of geometric \emph{t}-spanners}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1564499}, doi = {10.1145/1498698.1564499}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/FarshiG09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/FigueroaCNP09, author = {Karina Figueroa and Edgar Ch{\'{a}}vez and Gonzalo Navarro and Rodrigo Paredes}, title = {Speeding up spatial approximation search in metric spaces}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1564506}, doi = {10.1145/1498698.1564506}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/FigueroaCNP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/FriasPR09, author = {Leonor Frias and Jordi Petit and Salvador Roura}, title = {Lists revisited: Cache-conscious {STL} lists}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1564505}, doi = {10.1145/1498698.1564505}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/FriasPR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/HolzerSWPZ09, author = {Martin Holzer and Frank Schulz and Dorothea Wagner and Grigorios Prasinos and Christos D. Zaroliagis}, title = {Engineering planar separator algorithms}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1571635}, doi = {10.1145/1498698.1571635}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/HolzerSWPZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/IrvingM09, author = {Robert W. Irving and David F. Manlove}, title = {Finding large stable matchings}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1537595}, doi = {10.1145/1498698.1537595}, timestamp = {Tue, 13 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/IrvingM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/Julstrom09, author = {Bryant A. Julstrom}, title = {Greedy heuristics for the bounded diameter minimum spanning tree problem}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1498699}, doi = {10.1145/1498698.1498699}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/Julstrom09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/LoeraHLO09, author = {Jes{\'{u}}s A. De Loera and David C. Haws and Jon Lee and Allison O'Hair}, title = {Computation in multicriteria matroid optimization}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1658383}, doi = {10.1145/1498698.1658383}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/LoeraHLO09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/MaueSM09, author = {Jens Maue and Peter Sanders and Domagoj Matijevic}, title = {Goal-directed shortest-path queries using precomputed cluster distances}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1564502}, doi = {10.1145/1498698.1564502}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/MaueSM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/MunroW09, author = {J. Ian Munro and Dorothea Wagner}, title = {Preface}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1537596}, doi = {10.1145/1498698.1537596}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/MunroW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/PutzeSS09, author = {Felix Putze and Peter Sanders and Johannes Singler}, title = {Cache-, hash-, and space-efficient bloom filters}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1594230}, doi = {10.1145/1498698.1594230}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/PutzeSS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/SernaA09, author = {Maria J. Serna and Carme {\`{A}}lvarez}, title = {Preface to special section of selected papers from {WEA} 2006}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1564501}, doi = {10.1145/1498698.1564501}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/SernaA09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/TarjanW09, author = {Robert Endre Tarjan and Renato Fonseca F. Werneck}, title = {Dynamic trees in practice}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1594231}, doi = {10.1145/1498698.1594231}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/TarjanW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/ValimakiMGD09, author = {Niko V{\"{a}}lim{\"{a}}ki and Veli M{\"{a}}kinen and Wolfgang Gerlach and Kashyap Dixit}, title = {Engineering a compressed suffix tree implementation}, journal = {{ACM} J. Exp. Algorithmics}, volume = {14}, year = {2009}, url = {https://doi.org/10.1145/1498698.1594228}, doi = {10.1145/1498698.1594228}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/ValimakiMGD09.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.