Search dblp for Publications

export results for "toc:db/journals/jea/jea21.bht:"

 download as .bib file

@article{DBLP:journals/jea/0001Z16,
  author       = {Peter Sanders and
                  Norbert Zeh},
  title        = {Introduction to Special Issue {ALENEX} 2013},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {2.1:1--2.1:2},
  year         = {2016},
  url          = {https://doi.org/10.1145/2966922},
  doi          = {10.1145/2966922},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/0001Z16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/BergnerLW16,
  author       = {Martin Bergner and
                  Marco E. L{\"{u}}bbecke and
                  Jonas T. Witt},
  title        = {A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.2:1--1.2:16},
  year         = {2016},
  url          = {https://doi.org/10.1145/2851492},
  doi          = {10.1145/2851492},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/BergnerLW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/Bingmann0O16,
  author       = {Timo Bingmann and
                  Johannes Fischer and
                  Vitaly Osipov},
  title        = {Inducing Suffix and {LCP} Arrays in External Memory},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {2.3:1--2.3:27},
  year         = {2016},
  url          = {https://doi.org/10.1145/2975593},
  doi          = {10.1145/2975593},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/Bingmann0O16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/CoudertMN16,
  author       = {David Coudert and
                  Dorian Mazauric and
                  Nicolas Nisse},
  title        = {Experimental Evaluation of a Branch-and-Bound Algorithm for Computing
                  Pathwidth and Directed Pathwidth},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.3:1--1.3:23},
  year         = {2016},
  url          = {https://doi.org/10.1145/2851494},
  doi          = {10.1145/2851494},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/CoudertMN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/DibbeltSW16,
  author       = {Julian Dibbelt and
                  Ben Strasser and
                  Dorothea Wagner},
  title        = {Customizable Contraction Hierarchies},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.5:1--1.5:49},
  year         = {2016},
  url          = {https://doi.org/10.1145/2886843},
  doi          = {10.1145/2886843},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/DibbeltSW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/EfentakisP16,
  author       = {Alexandros Efentakis and
                  Dieter Pfoser},
  title        = {ReHub: Extending Hub Labels for Reverse \emph{k}-Nearest Neighbor
                  Queries on Large-Scale Networks},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.13:1--1.13:35},
  year         = {2016},
  url          = {https://doi.org/10.1145/2990192},
  doi          = {10.1145/2990192},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/EfentakisP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/Fox-EpsteinMP016,
  author       = {Eli Fox{-}Epstein and
                  Shay Mozes and
                  Phitchaya Mangpo Phothilimthana and
                  Christian Sommer},
  title        = {Short and Simple Cycle Separators in Planar Graphs},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {2.2:1--2.2:24},
  year         = {2016},
  url          = {https://doi.org/10.1145/2957318},
  doi          = {10.1145/2957318},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/Fox-EpsteinMP016.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/GemsaNR16,
  author       = {Andreas Gemsa and
                  Martin N{\"{o}}llenburg and
                  Ignaz Rutter},
  title        = {Evaluation of Labeling Strategies for Rotating Maps},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.4:1--1.4:21},
  year         = {2016},
  url          = {https://doi.org/10.1145/2851493},
  doi          = {10.1145/2851493},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/GemsaNR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/GlantzMS16,
  author       = {Roland Glantz and
                  Henning Meyerhenke and
                  Christian Schulz},
  title        = {Tree-Based Coarsening and Partitioning of Complex Networks},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.6:1--1.6:20},
  year         = {2016},
  url          = {https://doi.org/10.1145/2851496},
  doi          = {10.1145/2851496},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/GlantzMS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/GudmundssonK16,
  author       = {Joachim Gudmundsson and
                  Jyrki Katajainen},
  title        = {Editorial, {SEA} 2014 Special Issue},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.1:1},
  year         = {2016},
  url          = {https://doi.org/10.1145/2854021},
  doi          = {10.1145/2854021},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/GudmundssonK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/KarkkainenK16,
  author       = {Juha K{\"{a}}rkk{\"{a}}inen and
                  Dominik Kempa},
  title        = {{LCP} Array Construction in External Memory},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.7:1--1.7:22},
  year         = {2016},
  url          = {https://doi.org/10.1145/2851491},
  doi          = {10.1145/2851491},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/KarkkainenK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/KarkkainenKP16,
  author       = {Juha K{\"{a}}rkk{\"{a}}inen and
                  Dominik Kempa and
                  Simon J. Puglisi},
  title        = {Lazy Lempel-Ziv Factorization Algorithms},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {2.4:1--2.4:19},
  year         = {2016},
  url          = {https://doi.org/10.1145/2699876},
  doi          = {10.1145/2699876},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/KarkkainenKP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/MarinovNG16,
  author       = {Martin Marinov and
                  Nicholas Nash and
                  David Gregg},
  title        = {Practical Algorithms for Finding Extremal Sets},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.9:1--1.9:21},
  year         = {2016},
  url          = {https://doi.org/10.1145/2893184},
  doi          = {10.1145/2893184},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/MarinovNG16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/McGeoch16,
  author       = {Catherine C. McGeoch},
  title        = {In Memoriam: David S. Johnson},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.1e:1},
  year         = {2016},
  url          = {https://doi.org/10.1145/2907073},
  doi          = {10.1145/2907073},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/McGeoch16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/NavarroP16,
  author       = {Gonzalo Navarro and
                  Alberto Ord{\'{o}}{\~{n}}ez Pereira},
  title        = {Faster Compressed Suffix Trees for Repetitive Collections},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.8:1--1.8:38},
  year         = {2016},
  url          = {https://doi.org/10.1145/2851495},
  doi          = {10.1145/2851495},
  timestamp    = {Wed, 28 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jea/NavarroP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/PeethambaranPM16,
  author       = {Jiju Peethambaran and
                  Amal Dev Parakkat and
                  Ramanathan Muthuganapathy},
  title        = {An Empirical Study on Randomized Optimal Area Polygonization of Planar
                  Point Sets},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.10:1--1.10:24},
  year         = {2016},
  url          = {https://doi.org/10.1145/2896849},
  doi          = {10.1145/2896849},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/PeethambaranPM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/RosenbrockMHCF16,
  author       = {Conrad W. Rosenbrock and
                  Wiley S. Morgan and
                  Gus L. W. Hart and
                  Stefano Curtarolo and
                  Rodney W. Forcade},
  title        = {Numerical Algorithm for P{\'{o}}lya Enumeration Theorem},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.11:1--1.11:17},
  year         = {2016},
  url          = {https://doi.org/10.1145/2955094},
  doi          = {10.1145/2955094},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jea/RosenbrockMHCF16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/TodaS16,
  author       = {Takahisa Toda and
                  Takehide Soh},
  title        = {Implementing Efficient All Solutions {SAT} Solvers},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {21},
  number       = {1},
  pages        = {1.12:1--1.12:44},
  year         = {2016},
  url          = {https://doi.org/10.1145/2975585},
  doi          = {10.1145/2975585},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jea/TodaS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.