default search action
Search dblp for Publications
export results for "toc:db/journals/jea/jea13.bht:"
@article{DBLP:journals/jea/Bar-NoyLCT08, author = {Amotz Bar{-}Noy and Richard E. Ladner and Jacob Christensen and Tami Tamir}, title = {A general buffer scheme for the windows scheduling problem}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1412234}, doi = {10.1145/1412228.1412234}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/Bar-NoyLCT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/CrabtreeM08, author = {John D. Crabtree and Dinesh P. Mehta}, title = {Automated reaction mapping}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1498697}, doi = {10.1145/1412228.1498697}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/CrabtreeM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/ElmasryH08, author = {Amr Elmasry and Abdelrahman Hammad}, title = {Inversion-sensitive sorting algorithms in practice}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1455267}, doi = {10.1145/1412228.1455267}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/ElmasryH08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/FerraginaGNV08, author = {Paolo Ferragina and Rodrigo Gonz{\'{a}}lez and Gonzalo Navarro and Rossano Venturini}, title = {Compressed text indexes: From theory to practice}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1455268}, doi = {10.1145/1412228.1455268}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/FerraginaGNV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/Fredriksson08, author = {Kimmo Fredriksson}, title = {Succinct backward-DAWG-matching}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1455263}, doi = {10.1145/1412228.1455263}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/Fredriksson08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/GottlobS08, author = {Georg Gottlob and Marko Samer}, title = {A backtracking-based algorithm for hypertree decomposition}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1412229}, doi = {10.1145/1412228.1412229}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/GottlobS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/GrammGHN08, author = {Jens Gramm and Jiong Guo and Falk H{\"{u}}ffner and Rolf Niedermeier}, title = {Data reduction and exact algorithms for clique cover}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1412236}, doi = {10.1145/1412228.1412236}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/GrammGHN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/HaranH08, author = {Idit Haran and Dan Halperin}, title = {An experimental study of point location in planar arrangements in {CGAL}}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1412237}, doi = {10.1145/1412228.1412237}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/HaranH08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/HaverkortTZ08, author = {Herman J. Haverkort and Laura Toma and Yi Zhuang}, title = {Computing visibility on terrains in external memory}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1412233}, doi = {10.1145/1412228.1412233}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/HaverkortTZ08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/HershbergerSS08, author = {John Hershberger and Nisheeth Shrivastava and Subhash Suri}, title = {Summarizing spatial data streams using ClusterHulls}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1412238}, doi = {10.1145/1412228.1412238}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/HershbergerSS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/HolzerSW08, author = {Martin Holzer and Frank Schulz and Dorothea Wagner}, title = {Engineering multilevel overlay graphs for shortest-path queries}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1412239}, doi = {10.1145/1412228.1412239}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/HolzerSW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/KavithaK08, author = {Telikepalli Kavitha and Katakam Vamsi Krishna}, title = {An improved heuristic for computing short integral cycle bases}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1498696}, doi = {10.1145/1412228.1498696}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/KavithaK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/LanthierNW08, author = {Mark Lanthier and Doron Nussbaum and Tsuo{-}Jung Wang}, title = {Computing an approximation of the 1-center problem on weighted terrain surfaces}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1412231}, doi = {10.1145/1412228.1412231}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/LanthierNW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/LarssonGHPT08, author = {Andreas Larsson and Anders Gidenstam and Phuong Hoai Ha and Marina Papatriantafilou and Philippas Tsigas}, title = {Multiword atomic read/write registers on multiprocessor systems}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1455262}, doi = {10.1145/1412228.1455262}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/LarssonGHPT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/MagnienLH08, author = {Cl{\'{e}}mence Magnien and Matthieu Latapy and Michel Habib}, title = {Fast computation of empirically tight bounds for the diameter of massive graphs}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1455266}, doi = {10.1145/1412228.1455266}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/MagnienLH08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/Naanaa08, author = {Wady Naanaa}, title = {A domain decomposition algorithm for constraint satisfaction}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1455269}, doi = {10.1145/1412228.1455269}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/Naanaa08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/NashLG08, author = {Nicholas Nash and Sylvain Lelait and David Gregg}, title = {Efficiently implementing maximum independent set algorithms on circle graphs}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1455265}, doi = {10.1145/1412228.1455265}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/NashLG08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/Navarro08, author = {Gonzalo Navarro}, title = {Implementing the LZ-index: Theory versus practice}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1412230}, doi = {10.1145/1412228.1412230}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/Navarro08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/RamanS08, author = {Rajeev Raman and Matthias F. Stallmann}, title = {Preface}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1412235}, doi = {10.1145/1412228.1412235}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/RamanS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/SafroRB08, author = {Ilya Safro and Dorit Ron and Achi Brandt}, title = {Multilevel algorithms for linear ordering problems}, journal = {{ACM} J. Exp. Algorithmics}, volume = {13}, year = {2008}, url = {https://doi.org/10.1145/1412228.1412232}, doi = {10.1145/1412228.1412232}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/SafroRB08.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.