Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jea/AfshaniBCKLST18,
  author       = {Peyman Afshani and
                  Mark de Berg and
                  Henri Casanova and
                  Ben Karsin and
                  Colin Lambrechts and
                  Nodari Sitchinava and
                  Constantinos Tsirogiannis},
  title        = {An Efficient Algorithm for the 1D Total Visibility-Index Problem and
                  Its Parallelization},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3209685},
  doi          = {10.1145/3209685},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jea/AfshaniBCKLST18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/BergaminiCDMSV18,
  author       = {Elisabetta Bergamini and
                  Pierluigi Crescenzi and
                  Gianlorenzo D'Angelo and
                  Henning Meyerhenke and
                  Lorenzo Severini and
                  Yllka Velaj},
  title        = {Improving the Betweenness Centrality of a Node by Adding Links},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3166071},
  doi          = {10.1145/3166071},
  timestamp    = {Sun, 12 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jea/BergaminiCDMSV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/DibbeltPSW18,
  author       = {Julian Dibbelt and
                  Thomas Pajor and
                  Ben Strasser and
                  Dorothea Wagner},
  title        = {Connection Scan Algorithm},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3274661},
  doi          = {10.1145/3274661},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/DibbeltPSW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/HamannMPTW18,
  author       = {Michael Hamann and
                  Ulrich Meyer and
                  Manuel Penschuck and
                  Hung Tran and
                  Dorothea Wagner},
  title        = {I/O-Efficient Generation of Massive Graphs Following the \emph{LFR}
                  Benchmark},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3230743},
  doi          = {10.1145/3230743},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/HamannMPTW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/HamannS18,
  author       = {Michael Hamann and
                  Ben Strasser},
  title        = {Graph Bisection with Pareto Optimization},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3173045},
  doi          = {10.1145/3173045},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/HamannS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/HenzingerNSS18,
  author       = {Monika Henzinger and
                  Alexander Noe and
                  Christian Schulz and
                  Darren Strash},
  title        = {Practical Minimum Cut Algorithms},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3274662},
  doi          = {10.1145/3274662},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jea/HenzingerNSS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/LoozM18,
  author       = {Moritz von Looz and
                  Henning Meyerhenke},
  title        = {Updating Dynamic Random Hyperbolic Graphs in Sublinear Time},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3195635},
  doi          = {10.1145/3195635},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jea/LoozM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/Mann18,
  author       = {Zolt{\'{a}}n {\'{A}}d{\'{a}}m Mann},
  title        = {Complexity of Coloring Random Graphs: An Experimental Study of the
                  Hardest Region},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3183350},
  doi          = {10.1145/3183350},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jea/Mann18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/PaudelGI18,
  author       = {Nilakantha Paudel and
                  Loukas Georgiadis and
                  Giuseppe F. Italiano},
  title        = {Computing Critical Nodes in Directed Graphs},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3228332},
  doi          = {10.1145/3228332},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/PaudelGI18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/PolischchukRC18,
  author       = {Valentin Polishchuk and
                  Vijaya Ramachandran and
                  Rezaul Alam Chowdhury},
  title        = {Editorial: {ALENEX} 2017 Special Issue},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3239166},
  doi          = {10.1145/3239166},
  timestamp    = {Wed, 17 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jea/PolischchukRC18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/RobinsonVHE18,
  author       = {Jeffrey A. Robinson and
                  Susan V. Vrbsky and
                  Xiaoyan Hong and
                  Brian P. Eddy},
  title        = {Analysis of a High-Performance {TSP} Solver on the {GPU}},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3154835},
  doi          = {10.1145/3154835},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/RobinsonVHE18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/SieranojaF18,
  author       = {Sami Sieranoja and
                  Pasi Fr{\"{a}}nti},
  title        = {Constructing a High-Dimensional \emph{k}NN-Graph Using a Z-Order Curve},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3274656},
  doi          = {10.1145/3274656},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/SieranojaF18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/TsirogiannisSP18,
  author       = {Constantinos Tsirogiannis and
                  Frank Staals and
                  Vincent Pellissier},
  title        = {Computing the Expected Value and Variance of Geometric Measures},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3228331},
  doi          = {10.1145/3228331},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/TsirogiannisSP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/VellaBC18,
  author       = {Flavio Vella and
                  Massimo Bernaschi and
                  Giancarlo Carbone},
  title        = {Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness
                  Centrality},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3182656},
  doi          = {10.1145/3182656},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/VellaBC18.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.