Search dblp for Publications

export results for "stream:streams/journals/talg:"

 download as .bib file

@article{DBLP:journals/talg/0001W20,
  author    = {Fabrizio Grandoni and
               Virginia Vassilevska Williams},
  title     = {Faster Replacement Paths and Distance Sensitivity Oracles},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {15:1--15:25},
  year      = {2020},
  url       = {https://doi.org/10.1145/3365835},
  doi       = {10.1145/3365835},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/0001W20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AbrahamCEFN20,
  author    = {Ittai Abraham and
               Shiri Chechik and
               Michael Elkin and
               Arnold Filtser and
               Ofer Neiman},
  title     = {Ramsey Spanning Trees and Their Applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {19:1--19:21},
  year      = {2020},
  url       = {https://doi.org/10.1145/3371039},
  doi       = {10.1145/3371039},
  timestamp = {Tue, 26 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AbrahamCEFN20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AgrawalLMSZ20,
  author    = {Akanksha Agrawal and
               Daniel Lokshtanov and
               Pranabendu Misra and
               Saket Saurabh and
               Meirav Zehavi},
  title     = {Polylogarithmic Approximation Algorithms for Weighted-{\(\mathscr{F}\)}-deletion
               Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {51:1--51:38},
  year      = {2020},
  url       = {https://doi.org/10.1145/3389338},
  doi       = {10.1145/3389338},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AgrawalLMSZ20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlmanMW20,
  author    = {Josh Alman and
               Matthias Mnich and
               Virginia Vassilevska Williams},
  title     = {Dynamic Parameterized Problems and Algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {45:1--45:46},
  year      = {2020},
  url       = {https://doi.org/10.1145/3395037},
  doi       = {10.1145/3395037},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AlmanMW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AntoniadisFHS20,
  author    = {Antonios Antoniadis and
               Krzysztof Fleszar and
               Ruben Hoeksma and
               Kevin Schewior},
  title     = {A {PTAS} for Euclidean {TSP} with Hyperplane Neighborhoods},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {38:1--38:16},
  year      = {2020},
  url       = {https://doi.org/10.1145/3383466},
  doi       = {10.1145/3383466},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AntoniadisFHS20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AsathullaKLR20,
  author    = {Mudabir Kabir Asathulla and
               Sanjeev Khanna and
               Nathaniel Lahn and
               Sharath Raghvendra},
  title     = {A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in
               Planar Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {2:1--2:30},
  year      = {2020},
  url       = {https://doi.org/10.1145/3365006},
  doi       = {10.1145/3365006},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AsathullaKLR20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BackensG20,
  author    = {Miriam Backens and
               Leslie Ann Goldberg},
  title     = {Holant Clones and the Approximability of Conservative Holant Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {23:1--23:55},
  year      = {2020},
  url       = {https://doi.org/10.1145/3381425},
  doi       = {10.1145/3381425},
  timestamp = {Tue, 26 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BackensG20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BalcanHW20,
  author    = {Maria{-}Florina Balcan and
               Nika Haghtalab and
               Colin White},
  title     = {\emph{k}-center Clustering under Perturbation Resilience},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {22:1--22:39},
  year      = {2020},
  url       = {https://doi.org/10.1145/3381424},
  doi       = {10.1145/3381424},
  timestamp = {Tue, 26 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BalcanHW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Bar-OnDDHKRS20,
  author    = {Achiya Bar{-}On and
               Itai Dinur and
               Orr Dunkelman and
               Rani Hod and
               Nathan Keller and
               Eyal Ronen and
               Adi Shamir},
  title     = {Tight Bounds on Online Checkpointing Algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {31:1--31:22},
  year      = {2020},
  url       = {https://doi.org/10.1145/3379543},
  doi       = {10.1145/3379543},
  timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Bar-OnDDHKRS20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaswanaCHR20,
  author    = {Surender Baswana and
               Keerti Choudhary and
               Moazzam Hussain and
               Liam Roditty},
  title     = {Approximate Single-Source Fault Tolerant Shortest Path},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {44:1--44:22},
  year      = {2020},
  url       = {https://doi.org/10.1145/3397532},
  doi       = {10.1145/3397532},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BaswanaCHR20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BeameHRRS20,
  author    = {Paul Beame and
               Sariel Har{-}Peled and
               Sivaramakrishnan Natarajan Ramamoorthy and
               Cyrus Rashtchian and
               Makrand Sinha},
  title     = {Edge Estimation with Independent Set Oracles},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {52:1--52:27},
  year      = {2020},
  url       = {https://doi.org/10.1145/3404867},
  doi       = {10.1145/3404867},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BeameHRRS20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BelazzouguiCKM20,
  author    = {Djamal Belazzougui and
               Fabio Cunial and
               Juha K{\"{a}}rkk{\"{a}}inen and
               Veli M{\"{a}}kinen},
  title     = {Linear-time String Indexing and Analysis in Small Space},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {17:1--17:54},
  year      = {2020},
  url       = {https://doi.org/10.1145/3381417},
  doi       = {10.1145/3381417},
  timestamp = {Tue, 26 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BelazzouguiCKM20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BergerKMV20,
  author    = {Andr{\'{e}} Berger and
               L{\'{a}}szl{\'{o}} Kozma and
               Matthias Mnich and
               Roland Vincze},
  title     = {Time- and Space-optimal Algorithm for the Many-visits {TSP}},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {35:1--35:22},
  year      = {2020},
  url       = {https://doi.org/10.1145/3382038},
  doi       = {10.1145/3382038},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BergerKMV20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BlancaCSV20,
  author    = {Antonio Blanca and
               Zongchen Chen and
               Daniel Stefankovic and
               Eric Vigoda},
  title     = {Structure Learning of H-Colorings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {36:1--36:28},
  year      = {2020},
  url       = {https://doi.org/10.1145/3382207},
  doi       = {10.1145/3382207},
  timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BlancaCSV20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Blasiok20,
  author    = {Jaroslaw Blasiok},
  title     = {Optimal Streaming and Tracking Distinct Elements with High Probability},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {3:1--3:28},
  year      = {2020},
  url       = {https://doi.org/10.1145/3309193},
  doi       = {10.1145/3309193},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Blasiok20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BliznetsCKPM20,
  author    = {Ivan Bliznets and
               Marek Cygan and
               Pawel Komosa and
               Michal Pilipczuk and
               Luk{\'{a}}s Mach},
  title     = {Lower Bounds for the Parameterized Complexity of Minimum Fill-in and
               Other Completion Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {25:1--25:31},
  year      = {2020},
  url       = {https://doi.org/10.1145/3381426},
  doi       = {10.1145/3381426},
  timestamp = {Tue, 26 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BliznetsCKPM20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BlomerBB20,
  author    = {Johannes Bl{\"{o}}mer and
               Sascha Brauer and
               Kathrin Bujna},
  title     = {A Complexity Theoretical Study of Fuzzy \emph{K}-Means},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {53:1--53:25},
  year      = {2020},
  url       = {https://doi.org/10.1145/3409385},
  doi       = {10.1145/3409385},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BlomerBB20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BonamyDHPR20,
  author    = {Marthe Bonamy and
               Oscar Defrain and
               Marc Heinrich and
               Michal Pilipczuk and
               Jean{-}Florent Raymond},
  title     = {Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {39:1--39:23},
  year      = {2020},
  url       = {https://doi.org/10.1145/3386686},
  doi       = {10.1145/3386686},
  timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BonamyDHPR20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BonnetM20,
  author    = {{\'{E}}douard Bonnet and
               Tillmann Miltzow},
  title     = {Parameterized Hardness of Art Gallery Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {42:1--42:23},
  year      = {2020},
  url       = {https://doi.org/10.1145/3398684},
  doi       = {10.1145/3398684},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BonnetM20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BringmannGMW20,
  author    = {Karl Bringmann and
               Pawel Gawrychowski and
               Shay Mozes and
               Oren Weimann},
  title     = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless
               {APSP} Can)},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {48:1--48:22},
  year      = {2020},
  url       = {https://doi.org/10.1145/3381878},
  doi       = {10.1145/3381878},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BringmannGMW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BrubachSS020,
  author    = {Brian Brubach and
               Karthik Abinav Sankararaman and
               Aravind Srinivasan and
               Pan Xu},
  title     = {Algorithms to Approximate Column-sparse Packing Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {10:1--10:32},
  year      = {2020},
  url       = {https://doi.org/10.1145/3355400},
  doi       = {10.1145/3355400},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BrubachSS020.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CarbonnelRZ20,
  author    = {Cl{\'{e}}ment Carbonnel and
               Miguel Romero and
               Stanislav Zivn{\'{y}}},
  title     = {Point-Width and Max-CSPs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {54:1--54:28},
  year      = {2020},
  url       = {https://doi.org/10.1145/3409447},
  doi       = {10.1145/3409447},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CarbonnelRZ20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChakrabartyGK20,
  author    = {Deeparnab Chakrabarty and
               Prachi Goyal and
               Ravishankar Krishnaswamy},
  title     = {The Non-Uniform \emph{k}-Center Problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {46:1--46:19},
  year      = {2020},
  url       = {https://doi.org/10.1145/3392720},
  doi       = {10.1145/3392720},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChakrabartyGK20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Chan20,
  author    = {Timothy M. Chan},
  title     = {More Logarithmic-factor Speedups for 3SUM, (median, +)-convolution,
               and Some Geometric 3SUM-hard Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {7:1--7:23},
  year      = {2020},
  url       = {https://doi.org/10.1145/3363541},
  doi       = {10.1145/3363541},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Chan20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChanJJ20,
  author    = {T.{-}H. Hubert Chan and
               Haotian Jiang and
               Shaofeng H.{-}C. Jiang},
  title     = {A Unified {PTAS} for Prize Collecting {TSP} and Steiner Tree Problem
               in Doubling Metrics},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {24:1--24:23},
  year      = {2020},
  url       = {https://doi.org/10.1145/3378571},
  doi       = {10.1145/3378571},
  timestamp = {Tue, 26 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChanJJ20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChangHLPU20,
  author    = {Yi{-}Jun Chang and
               Qizheng He and
               Wenzheng Li and
               Seth Pettie and
               Jara Uitto},
  title     = {Distributed Edge Coloring and a Special Case of the Constructive Lov{\'{a}}sz
               Local Lemma},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {8:1--8:51},
  year      = {2020},
  url       = {https://doi.org/10.1145/3365004},
  doi       = {10.1145/3365004},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChangHLPU20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChiplunkarV20,
  author    = {Ashish Chiplunkar and
               Sundar Vishwanathan},
  title     = {Randomized Memoryless Algorithms for the Weighted and the Generalized
               \emph{k}-server Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {14:1--14:28},
  year      = {2020},
  url       = {https://doi.org/10.1145/3365002},
  doi       = {10.1145/3365002},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChiplunkarV20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChlamtacDKL20,
  author    = {Eden Chlamt{\'{a}}c and
               Michael Dinitz and
               Guy Kortsarz and
               Bundit Laekhanukit},
  title     = {Approximating Spanners and Directed Steiner Forest: Upper and Lower
               Bounds},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {33:1--33:31},
  year      = {2020},
  url       = {https://doi.org/10.1145/3381451},
  doi       = {10.1145/3381451},
  timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChlamtacDKL20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CsehF20,
  author    = {{\'{A}}gnes Cseh and
               Tam{\'{a}}s Fleiner},
  title     = {The Complexity of Cake Cutting with Unequal Shares},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {29:1--29:21},
  year      = {2020},
  url       = {https://doi.org/10.1145/3380742},
  doi       = {10.1145/3380742},
  timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CsehF20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DyerGGJV20,
  author    = {Martin E. Dyer and
               Andreas Galanis and
               Leslie Ann Goldberg and
               Mark Jerrum and
               Eric Vigoda},
  title     = {Random Walks on Small World Networks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {37:1--37:33},
  year      = {2020},
  url       = {https://doi.org/10.1145/3382208},
  doi       = {10.1145/3382208},
  timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/DyerGGJV20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EdenLR20,
  author    = {Talya Eden and
               Reut Levi and
               Dana Ron},
  title     = {Testing Bounded Arboricity},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {18:1--18:22},
  year      = {2020},
  url       = {https://doi.org/10.1145/3381418},
  doi       = {10.1145/3381418},
  timestamp = {Tue, 26 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/EdenLR20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EibenK20,
  author    = {Eduard Eiben and
               Iyad Kanj},
  title     = {A Colored Path Problem and Its Applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {47:1--47:48},
  year      = {2020},
  url       = {https://doi.org/10.1145/3396573},
  doi       = {10.1145/3396573},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/EibenK20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EisenbrandW20,
  author    = {Friedrich Eisenbrand and
               Robert Weismantel},
  title     = {Proximity Results and Faster Algorithms for Integer Programming Using
               the Steinitz Lemma},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {5:1--5:14},
  year      = {2020},
  url       = {https://doi.org/10.1145/3340322},
  doi       = {10.1145/3340322},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EisenbrandW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FischerIK20,
  author    = {Johannes Fischer and
               Tomohiro I and
               Dominik K{\"{o}}ppl},
  title     = {Deterministic Sparse Suffix Sorting in the Restore Model},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {50:1--50:53},
  year      = {2020},
  url       = {https://doi.org/10.1145/3398681},
  doi       = {10.1145/3398681},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FischerIK20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FischerN20,
  author    = {Manuela Fischer and
               Andreas Noever},
  title     = {Tight Analysis of Parallel Randomized Greedy {MIS}},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {6:1--6:13},
  year      = {2020},
  url       = {https://doi.org/10.1145/3326165},
  doi       = {10.1145/3326165},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FischerN20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FominGLP020,
  author    = {Fedor V. Fomin and
               Petr A. Golovach and
               Daniel Lokshtanov and
               Fahad Panolan and
               Saket Saurabh},
  title     = {Approximation Schemes for Low-rank Binary Matrix Approximation Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {12:1--12:39},
  year      = {2020},
  url       = {https://doi.org/10.1145/3365653},
  doi       = {10.1145/3365653},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FominGLP020.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FominLKPS20,
  author    = {Fedor V. Fomin and
               Daniel Lokshtanov and
               Sudeshna Kolay and
               Fahad Panolan and
               Saket Saurabh},
  title     = {Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence
               Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {21:1--21:37},
  year      = {2020},
  url       = {https://doi.org/10.1145/3381420},
  doi       = {10.1145/3381420},
  timestamp = {Tue, 26 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FominLKPS20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GalvezSV20,
  author    = {Waldo G{\'{a}}lvez and
               Jos{\'{e}} A. Soto and
               Jos{\'{e}} Verschae},
  title     = {Symmetry Exploitation for Online Machine Covering with Bounded Migration},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {43:1--43:22},
  year      = {2020},
  url       = {https://doi.org/10.1145/3397535},
  doi       = {10.1145/3397535},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GalvezSV20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GawrychowskiMW20,
  author    = {Pawel Gawrychowski and
               Shay Mozes and
               Oren Weimann},
  title     = {Submatrix Maximum Queries in Monge and Partial Monge Matrices Are
               Equivalent to Predecessor Search},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {16:1--16:24},
  year      = {2020},
  url       = {https://doi.org/10.1145/3381416},
  doi       = {10.1145/3381416},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GawrychowskiMW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GroheNSW20,
  author    = {Martin Grohe and
               Daniel Neuen and
               Pascal Schweitzer and
               Daniel Wiebking},
  title     = {An Improved Isomorphism Test for Bounded-tree-width Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {34:1--34:31},
  year      = {2020},
  url       = {https://doi.org/10.1145/3382082},
  doi       = {10.1145/3382082},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GroheNSW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HsuU20,
  author    = {Chloe Ching{-}Yun Hsu and
               Chris Umans},
  title     = {A New Algorithm for Fast Generalized DFTs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {4:1--4:20},
  year      = {2020},
  url       = {https://doi.org/10.1145/3301313},
  doi       = {10.1145/3301313},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HsuU20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Kisfaludi-BakNL20,
  author    = {S{\'{a}}ndor Kisfaludi{-}Bak and
               Jesper Nederlof and
               Erik Jan van Leeuwen},
  title     = {Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals
               on Few Faces},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {28:1--28:30},
  year      = {2020},
  url       = {https://doi.org/10.1145/3371389},
  doi       = {10.1145/3371389},
  timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Kisfaludi-BakNL20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KociumakaKRRW20,
  author    = {Tomasz Kociumaka and
               Marcin Kubica and
               Jakub Radoszewski and
               Wojciech Rytter and
               Tomasz Walen},
  title     = {A Linear-Time Algorithm for Seeds Computation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {27:1--27:23},
  year      = {2020},
  url       = {https://doi.org/10.1145/3386369},
  doi       = {10.1145/3386369},
  timestamp = {Tue, 26 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/KociumakaKRRW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LeePW20,
  author    = {Yin Tat Lee and
               Marcin Pilipczuk and
               David P. Woodruff},
  title     = {Introduction to the Special Issue on SODA'18},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {1:1--1:2},
  year      = {2020},
  url       = {https://doi.org/10.1145/3368307},
  doi       = {10.1145/3368307},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LeePW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LeeS20,
  author    = {Euiwoong Lee and
               Sahil Singla},
  title     = {Maximum Matching in the Online Batch-arrival Model},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {4},
  pages     = {49:1--49:31},
  year      = {2020},
  url       = {https://doi.org/10.1145/3399676},
  doi       = {10.1145/3399676},
  timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/LeeS20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LokshtanovPSSZ20,
  author    = {Daniel Lokshtanov and
               Fahad Panolan and
               Saket Saurabh and
               Roohani Sharma and
               Meirav Zehavi},
  title     = {Covering Small Independent Sets and Separators with Applications to
               Parameterized Algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {32:1--32:31},
  year      = {2020},
  url       = {https://doi.org/10.1145/3379698},
  doi       = {10.1145/3379698},
  timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/LokshtanovPSSZ20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MartinsPQS20,
  author    = {Rodrigo S. V. Martins and
               Daniel Panario and
               Claudio M. Qureshi and
               Eric Schmutz},
  title     = {Periods of Iterations of Functions with Restricted Preimage Sizes},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {30:1--30:28},
  year      = {2020},
  url       = {https://doi.org/10.1145/3378570},
  doi       = {10.1145/3378570},
  timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/MartinsPQS20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/OnakSSW20,
  author    = {Krzysztof Onak and
               Baruch Schieber and
               Shay Solomon and
               Nicole Wein},
  title     = {Fully Dynamic {MIS} in Uniformly Sparse Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {26:1--26:19},
  year      = {2020},
  url       = {https://doi.org/10.1145/3378025},
  doi       = {10.1145/3378025},
  timestamp = {Tue, 26 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/OnakSSW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Pandurangan0S20,
  author    = {Gopal Pandurangan and
               Peter Robinson and
               Michele Scquizzato},
  title     = {A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning
               Trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {13:1--13:27},
  year      = {2020},
  url       = {https://doi.org/10.1145/3365005},
  doi       = {10.1145/3365005},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Pandurangan0S20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RottenstreichKH20,
  author    = {Ori Rottenstreich and
               Haim Kaplan and
               Avinatan Hassidim},
  title     = {Clustering in Hypergraphs to Minimize Average Edge Service Time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {40:1--40:28},
  year      = {2020},
  url       = {https://doi.org/10.1145/3386121},
  doi       = {10.1145/3386121},
  timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/RottenstreichKH20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SawadaW20,
  author    = {Joe Sawada and
               Aaron Williams},
  title     = {Solving the Sigma-Tau Problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {11:1--11:17},
  year      = {2020},
  url       = {https://doi.org/10.1145/3359589},
  doi       = {10.1145/3359589},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/SawadaW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SolomonW20,
  author    = {Shay Solomon and
               Nicole Wein},
  title     = {Improved Dynamic Graph Coloring},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {3},
  pages     = {41:1--41:24},
  year      = {2020},
  url       = {https://doi.org/10.1145/3392724},
  doi       = {10.1145/3392724},
  timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/SolomonW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SoltanYZ20,
  author    = {Saleh Soltan and
               Mihalis Yannakakis and
               Gil Zussman},
  title     = {Doubly Balanced Connected Graph Partitioning},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {20:1--20:24},
  year      = {2020},
  url       = {https://doi.org/10.1145/3381419},
  doi       = {10.1145/3381419},
  timestamp = {Tue, 26 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/SoltanYZ20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SteinZ20,
  author    = {Clifford Stein and
               Mingxian Zhong},
  title     = {Scheduling When You Do Not Know the Number of Machines},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {9:1--9:20},
  year      = {2020},
  url       = {https://doi.org/10.1145/3340320},
  doi       = {10.1145/3340320},
  timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/SteinZ20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AbrahamsenW19,
  author    = {Mikkel Abrahamsen and
               Bartosz Walczak},
  title     = {Common Tangents of Two Disjoint Polygons in Linear Time and Constant
               Workspace},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {12:1--12:21},
  year      = {2019},
  url       = {https://doi.org/10.1145/3284355},
  doi       = {10.1145/3284355},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AbrahamsenW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AdamaszekCER19,
  author    = {Anna Adamaszek and
               Artur Czumaj and
               Matthias Englert and
               Harald R{\"{a}}cke},
  title     = {An \emph{O}(log \emph{k})-Competitive Algorithm for Generalized Caching},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {6:1--6:18},
  year      = {2019},
  url       = {https://doi.org/10.1145/3280826},
  doi       = {10.1145/3280826},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AdamaszekCER19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Adjiashvili19,
  author    = {David Adjiashvili},
  title     = {Beating Approximation Factor Two for Weighted Tree Augmentation with
               Bounded Costs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {19:1--19:26},
  year      = {2019},
  url       = {https://doi.org/10.1145/3182395},
  doi       = {10.1145/3182395},
  timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Adjiashvili19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AdjiashviliBZ19,
  author    = {David Adjiashvili and
               Andrea Baggio and
               Rico Zenklusen},
  title     = {Firefighting on Trees Beyond Integrality Gaps},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {20:1--20:33},
  year      = {2019},
  url       = {https://doi.org/10.1145/3173046},
  doi       = {10.1145/3173046},
  timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AdjiashviliBZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AgrawalLMSZ19,
  author    = {Akanksha Agrawal and
               Daniel Lokshtanov and
               Pranabendu Misra and
               Saket Saurabh and
               Meirav Zehavi},
  title     = {Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {11:1--11:28},
  year      = {2019},
  url       = {https://doi.org/10.1145/3284356},
  doi       = {10.1145/3284356},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AgrawalLMSZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AkitayaFT19,
  author    = {Hugo A. Akitaya and
               Radoslav Fulek and
               Csaba D. T{\'{o}}th},
  title     = {Recognizing Weak Embeddings of Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {4},
  pages     = {50:1--50:27},
  year      = {2019},
  url       = {https://doi.org/10.1145/3344549},
  doi       = {10.1145/3344549},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AkitayaFT19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AmiriSS19,
  author    = {Saeed Akhoondian Amiri and
               Stefan Schmid and
               Sebastian Siebertz},
  title     = {Distributed Dominating Set Approximations beyond Planar Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {39:1--39:18},
  year      = {2019},
  url       = {https://doi.org/10.1145/3326170},
  doi       = {10.1145/3326170},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AmiriSS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BansalEJK19,
  author    = {Nikhil Bansal and
               Marek Eli{\'{a}}s and
               Lukasz Jez and
               Grigorios Koumoutsos},
  title     = {The (\emph{h, k})-Server Problem on Bounded Depth Trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {28:1--28:26},
  year      = {2019},
  url       = {https://doi.org/10.1145/3301314},
  doi       = {10.1145/3301314},
  timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BansalEJK19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BeiGH19,
  author    = {Xiaohui Bei and
               Jugal Garg and
               Martin Hoefer},
  title     = {Ascending-Price Algorithms for Unknown Markets},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {37:1--37:33},
  year      = {2019},
  url       = {https://doi.org/10.1145/3319394},
  doi       = {10.1145/3319394},
  timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BeiGH19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BerenbrinkKKMU19,
  author    = {Petra Berenbrink and
               Ralf Klasing and
               Adrian Kosowski and
               Frederik Mallmann{-}Trenn and
               Przemyslaw Uznanski},
  title     = {Improved Analysis of Deterministic Load-Balancing Schemes},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {10:1--10:22},
  year      = {2019},
  url       = {https://doi.org/10.1145/3282435},
  doi       = {10.1145/3282435},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BerenbrinkKKMU19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BhattacharyyaDW19,
  author    = {Arnab Bhattacharyya and
               Palash Dey and
               David P. Woodruff},
  title     = {An Optimal Algorithm for {\(\mathscr{l}\)}\({}_{\mbox{1}}\)-Heavy
               Hitters in Insertion Streams and Related Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {2:1--2:27},
  year      = {2019},
  url       = {https://doi.org/10.1145/3264427},
  doi       = {10.1145/3264427},
  timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BhattacharyyaDW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BienkowskiBM19,
  author    = {Marcin Bienkowski and
               Jaroslaw Byrka and
               Marcin Mucha},
  title     = {Dynamic Beats Fixed: On Phase-based Algorithms for File Migration},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {4},
  pages     = {46:1--46:21},
  year      = {2019},
  url       = {https://doi.org/10.1145/3340296},
  doi       = {10.1145/3340296},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BienkowskiBM19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BlumHR19,
  author    = {Avrim Blum and
               Sariel Har{-}Peled and
               Benjamin Raichel},
  title     = {Sparse Approximation via Generating Point Sets},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {32:1--32:16},
  year      = {2019},
  url       = {https://doi.org/10.1145/3302249},
  doi       = {10.1145/3302249},
  timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BlumHR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BrennerH19,
  author    = {Ulrich Brenner and
               Anna Hermann},
  title     = {Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival
               Times},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {4},
  pages     = {45:1--45:23},
  year      = {2019},
  url       = {https://doi.org/10.1145/3340321},
  doi       = {10.1145/3340321},
  timestamp = {Wed, 23 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BrennerH19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BuchbinderFS19,
  author    = {Niv Buchbinder and
               Moran Feldman and
               Roy Schwartz},
  title     = {Online Submodular Maximization with Preemption},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {30:1--30:31},
  year      = {2019},
  url       = {https://doi.org/10.1145/3309764},
  doi       = {10.1145/3309764},
  timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BuchbinderFS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BunNS19,
  author    = {Mark Bun and
               Jelani Nelson and
               Uri Stemmer},
  title     = {Heavy Hitters and the Structure of Local Privacy},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {4},
  pages     = {51:1--51:40},
  year      = {2019},
  url       = {https://doi.org/10.1145/3344722},
  doi       = {10.1145/3344722},
  timestamp = {Wed, 23 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BunNS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Cabello19,
  author    = {Sergio Cabello},
  title     = {Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances
               in Planar Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {21:1--21:38},
  year      = {2019},
  url       = {https://doi.org/10.1145/3218821},
  doi       = {10.1145/3218821},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Cabello19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CairoMART19,
  author    = {Massimo Cairo and
               Paul Medvedev and
               Nidia Obscura Acosta and
               Romeo Rizzi and
               Alexandru I. Tomescu},
  title     = {An Optimal \emph{O}(\emph{nm}) Algorithm for Enumerating All Walks
               Common to All Closed Edge-covering Walks of a Graph},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {4},
  pages     = {48:1--48:17},
  year      = {2019},
  url       = {https://doi.org/10.1145/3341731},
  doi       = {10.1145/3341731},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CairoMART19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChakrabartyN19,
  author    = {Deeparnab Chakrabarty and
               Maryam Negahbani},
  title     = {Generalized Center Problems with Outliers},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {41:1--41:14},
  year      = {2019},
  url       = {https://doi.org/10.1145/3338513},
  doi       = {10.1145/3338513},
  timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChakrabartyN19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChangKPWZ19,
  author    = {Yi{-}Jun Chang and
               Tsvi Kopelowitz and
               Seth Pettie and
               Ruosong Wang and
               Wei Zhan},
  title     = {Exponential Separations in the Energy Complexity of Leader Election},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {4},
  pages     = {49:1--49:31},
  year      = {2019},
  url       = {https://doi.org/10.1145/3341111},
  doi       = {10.1145/3341111},
  timestamp = {Wed, 23 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChangKPWZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CheeCKN19,
  author    = {Yeow Meng Chee and
               Johan Chrisnata and
               Han Mao Kiah and
               Tuan Thanh Nguyen},
  title     = {Deciding the Confusability of Words under Tandem Repeats in Linear
               Time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {42:1--42:22},
  year      = {2019},
  url       = {https://doi.org/10.1145/3338514},
  doi       = {10.1145/3338514},
  timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CheeCKN19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CoudertDP19,
  author    = {David Coudert and
               Guillaume Ducoffe and
               Alexandru Popa},
  title     = {Fully Polynomial {FPT} Algorithms for Some Classes of Bounded Clique-width
               Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {33:1--33:57},
  year      = {2019},
  url       = {https://doi.org/10.1145/3310228},
  doi       = {10.1145/3310228},
  timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CoudertDP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganKS19,
  author    = {Marek Cygan and
               Lukasz Kowalik and
               Arkadiusz Socala},
  title     = {Improving {TSP} Tours Using Dynamic Programming over Tree Decompositions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {4},
  pages     = {54:1--54:19},
  year      = {2019},
  url       = {https://doi.org/10.1145/3341730},
  doi       = {10.1145/3341730},
  timestamp = {Wed, 23 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CyganKS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganMWW19,
  author    = {Marek Cygan and
               Marcin Mucha and
               Karol Wegrzycki and
               Michal Wlodarczyk},
  title     = {On Problems Equivalent to (min, +)-Convolution},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {14:1--14:25},
  year      = {2019},
  url       = {https://doi.org/10.1145/3293465},
  doi       = {10.1145/3293465},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CyganMWW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DisserS19,
  author    = {Yann Disser and
               Martin Skutella},
  title     = {The Simplex Algorithm Is NP-Mighty},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {5:1--5:19},
  year      = {2019},
  url       = {https://doi.org/10.1145/3280847},
  doi       = {10.1145/3280847},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/DisserS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ElkinN19,
  author    = {Michael Elkin and
               Ofer Neiman},
  title     = {Efficient Algorithms for Constructing Very Sparse Spanners and Emulators},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {4:1--4:29},
  year      = {2019},
  url       = {https://doi.org/10.1145/3274651},
  doi       = {10.1145/3274651},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ElkinN19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FerraioliV19,
  author    = {Diodato Ferraioli and
               Carmine Ventre},
  title     = {Metastability of the Logit Dynamics for Asymptotically Well-Behaved
               Potential Games},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {27:1--27:42},
  year      = {2019},
  url       = {https://doi.org/10.1145/3301315},
  doi       = {10.1145/3301315},
  timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FerraioliV19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FominGLS19,
  author    = {Fedor V. Fomin and
               Petr A. Golovach and
               Daniel Lokshtanov and
               Saket Saurabh},
  title     = {Spanning Circuits in Regular Matroids},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {4},
  pages     = {52:1--52:38},
  year      = {2019},
  url       = {https://doi.org/10.1145/3355629},
  doi       = {10.1145/3355629},
  timestamp = {Wed, 23 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FominGLS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FominGLSZ19,
  author    = {Fedor V. Fomin and
               Petr A. Golovach and
               Daniel Lokshtanov and
               Saket Saurabh and
               Meirav Zehavi},
  title     = {Clique-width {III:} Hamiltonian Cycle and the Odd Case of Graph Coloring},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {9:1--9:27},
  year      = {2019},
  url       = {https://doi.org/10.1145/3280824},
  doi       = {10.1145/3280824},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FominGLSZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FominLLSTZ19,
  author    = {Fedor V. Fomin and
               Tien{-}Nam Le and
               Daniel Lokshtanov and
               Saket Saurabh and
               St{\'{e}}phan Thomass{\'{e}} and
               Meirav Zehavi},
  title     = {Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing
               Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {13:1--13:44},
  year      = {2019},
  url       = {https://doi.org/10.1145/3293466},
  doi       = {10.1145/3293466},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FominLLSTZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FriggstadKRS19,
  author    = {Zachary Friggstad and
               Kamyar Khodamoradi and
               Mohsen Rezapour and
               Mohammad R. Salavatipour},
  title     = {Approximation Schemes for Clustering with Outliers},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {26:1--26:26},
  year      = {2019},
  url       = {https://doi.org/10.1145/3301446},
  doi       = {10.1145/3301446},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FriggstadKRS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GaoIKW19,
  author    = {Jiawei Gao and
               Russell Impagliazzo and
               Antonina Kolokolova and
               Ryan Williams},
  title     = {Completeness for First-order Properties on Sparse Structures with
               Algorithmic Applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {23:1--23:35},
  year      = {2019},
  url       = {https://doi.org/10.1145/3196275},
  doi       = {10.1145/3196275},
  timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GaoIKW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GolebiewskiMS19,
  author    = {Zbigniew Golebiewski and
               Abram Magner and
               Wojciech Szpankowski},
  title     = {Entropy and Optimal Compression of Some General Plane Trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {3:1--3:23},
  year      = {2019},
  url       = {https://doi.org/10.1145/3275444},
  doi       = {10.1145/3275444},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GolebiewskiMS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GorainP19,
  author    = {Barun Gorain and
               Andrzej Pelc},
  title     = {Deterministic Graph Exploration with Advice},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {8:1--8:17},
  year      = {2019},
  url       = {https://doi.org/10.1145/3280823},
  doi       = {10.1145/3280823},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GorainP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Harris19,
  author    = {David G. Harris},
  title     = {Derandomized Concentration Bounds for Polynomials, and Hypergraph
               Maximal Independent Set},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {43:1--43:29},
  year      = {2019},
  url       = {https://doi.org/10.1145/3326171},
  doi       = {10.1145/3326171},
  timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Harris19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HarrisPST19,
  author    = {David G. Harris and
               Thomas W. Pensyl and
               Aravind Srinivasan and
               Khoa Trinh},
  title     = {A Lottery Model for Center-Type Problems With Outliers},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {36:1--36:25},
  year      = {2019},
  url       = {https://doi.org/10.1145/3311953},
  doi       = {10.1145/3311953},
  timestamp = {Thu, 26 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HarrisPST19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HermelinMLW19,
  author    = {Danny Hermelin and
               Matthias Mnich and
               Erik Jan van Leeuwen and
               Gerhard J. Woeginger},
  title     = {Domination When the Stars Are Out},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {25:1--25:90},
  year      = {2019},
  url       = {https://doi.org/10.1145/3301445},
  doi       = {10.1145/3301445},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HermelinMLW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HeydrichW19,
  author    = {Sandy Heydrich and
               Andreas Wiese},
  title     = {Faster Approximation Schemes for the Two-Dimensional Knapsack Problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {4},
  pages     = {47:1--47:28},
  year      = {2019},
  url       = {https://doi.org/10.1145/3338512},
  doi       = {10.1145/3338512},
  timestamp = {Wed, 23 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/HeydrichW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Hirai19,
  author    = {Hiroshi Hirai},
  title     = {A Dual Descent Algorithm for Node-capacitated Multiflow Problems and
               Its Applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {15:1--15:24},
  year      = {2019},
  url       = {https://doi.org/10.1145/3291531},
  doi       = {10.1145/3291531},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Hirai19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HiraiIMZ19,
  author    = {Hiroshi Hirai and
               Yuni Iwamasa and
               Kazuo Murota and
               Stanislav Zivn{\'{y}}},
  title     = {A Tractable Class of Binary VCSPs via M-Convex Intersection},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {44:1--44:41},
  year      = {2019},
  url       = {https://doi.org/10.1145/3329862},
  doi       = {10.1145/3329862},
  timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/HiraiIMZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HuangTWZ19,
  author    = {Zhiyi Huang and
               Zhihao Gavin Tang and
               Xiaowei Wu and
               Yuhao Zhang},
  title     = {Online Vertex-Weighted Bipartite Matching: Beating 1-1/\emph{e} with
               Random Arrivals},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {38:1--38:15},
  year      = {2019},
  url       = {https://doi.org/10.1145/3326169},
  doi       = {10.1145/3326169},
  timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/HuangTWZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HunkenschroderV19,
  author    = {Christoph Hunkenschr{\"{o}}der and
               Santosh S. Vempala and
               Adrian Vetta},
  title     = {A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph
               Problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {4},
  pages     = {55:1--55:28},
  year      = {2019},
  url       = {https://doi.org/10.1145/3341599},
  doi       = {10.1145/3341599},
  timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/HunkenschroderV19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JansenMR19,
  author    = {Klaus Jansen and
               Marten Maack and
               Malin Rau},
  title     = {Approximation Schemes for Machine Scheduling with Resource (In-)dependent
               Processing Times},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {31:1--31:28},
  year      = {2019},
  url       = {https://doi.org/10.1145/3302250},
  doi       = {10.1145/3302250},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/JansenMR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KannanT19,
  author    = {Sampath Kannan and
               Kevin Tian},
  title     = {Locating Errors in Faulty Formulas},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {34:1--34:13},
  year      = {2019},
  url       = {https://doi.org/10.1145/3313776},
  doi       = {10.1145/3313776},
  timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/KannanT19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KazdaKR19,
  author    = {Alexandr Kazda and
               Vladimir Kolmogorov and
               Michal Rol{\'{\i}}nek},
  title     = {Even Delta-Matroids and the Complexity of Planar Boolean CSPs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {22:1--22:33},
  year      = {2019},
  url       = {https://doi.org/10.1145/3230649},
  doi       = {10.1145/3230649},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KazdaKR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KlemzR19,
  author    = {Boris Klemz and
               G{\"{u}}nter Rote},
  title     = {Ordered Level Planarity and Its Relationship to Geodesic Planarity,
               Bi-Monotonicity, and Variations of Level Planarity},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {4},
  pages     = {53:1--53:25},
  year      = {2019},
  url       = {https://doi.org/10.1145/3359587},
  doi       = {10.1145/3359587},
  timestamp = {Wed, 23 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/KlemzR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KoiliarisX19,
  author    = {Konstantinos Koiliaris and
               Chao Xu},
  title     = {Faster Pseudopolynomial Time Algorithms for Subset Sum},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {40:1--40:20},
  year      = {2019},
  url       = {https://doi.org/10.1145/3329863},
  doi       = {10.1145/3329863},
  timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/KoiliarisX19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KreutzerRS19,
  author    = {Stephan Kreutzer and
               Roman Rabinovich and
               Sebastian Siebertz},
  title     = {Polynomial Kernels and Wideness Properties of Nowhere Dense Graph
               Classes},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {24:1--24:19},
  year      = {2019},
  url       = {https://doi.org/10.1145/3274652},
  doi       = {10.1145/3274652},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/KreutzerRS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LiuCSSX19,
  author    = {Zhengyang Liu and
               Xi Chen and
               Rocco A. Servedio and
               Ying Sheng and
               Jinyu Xie},
  title     = {Distribution-free Junta Testing},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {1:1--1:23},
  year      = {2019},
  url       = {https://doi.org/10.1145/3264434},
  doi       = {10.1145/3264434},
  timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LiuCSSX19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LokshtanovM19,
  author    = {Daniel Lokshtanov and
               Amer E. Mouawad},
  title     = {The Complexity of Independent Set Reconfiguration on Bipartite Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {1},
  pages     = {7:1--7:19},
  year      = {2019},
  url       = {https://doi.org/10.1145/3280825},
  doi       = {10.1145/3280825},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/LokshtanovM19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MakinenTKPGC19,
  author    = {Veli M{\"{a}}kinen and
               Alexandru I. Tomescu and
               Anna Kuosmanen and
               Topi Paavilainen and
               Travis Gagie and
               Rayan Chikhi},
  title     = {Sparse Dynamic Programming on DAGs with Small Width},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {29:1--29:21},
  year      = {2019},
  url       = {https://doi.org/10.1145/3301312},
  doi       = {10.1145/3301312},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/MakinenTKPGC19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MarxWY19,
  author    = {D{\'{a}}niel Marx and
               Virginia Vassilevska Williams and
               Neal E. Young},
  title     = {Introduction to the Special Issue on {SODA} 2017},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {17:1--17:2},
  year      = {2019},
  url       = {https://doi.org/10.1145/3319426},
  doi       = {10.1145/3319426},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/MarxWY19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NaorY19,
  author    = {Moni Naor and
               Eylon Yogev},
  title     = {Bloom Filters in Adversarial Environments},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {3},
  pages     = {35:1--35:30},
  year      = {2019},
  url       = {https://doi.org/10.1145/3306193},
  doi       = {10.1145/3306193},
  timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/NaorY19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PazS19,
  author    = {Ami Paz and
               Gregory Schwartzman},
  title     = {A (2+{\(\epsilon\)})-Approximation for Maximum Weight Matching in
               the Semi-streaming Model},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {18:1--18:15},
  year      = {2019},
  url       = {https://doi.org/10.1145/3274668},
  doi       = {10.1145/3274668},
  timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/PazS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Srinivasan19,
  author    = {Aravind Srinivasan},
  title     = {Editorial},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {15},
  number    = {2},
  pages     = {16:1},
  year      = {2019},
  url       = {https://doi.org/10.1145/3325824},
  doi       = {10.1145/3325824},
  timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Srinivasan19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AbboudBHWZ18,
  author    = {Amir Abboud and
               Arturs Backurs and
               Thomas Dueholm Hansen and
               Virginia Vassilevska Williams and
               Or Zamir},
  title     = {Subtree Isomorphism Revisited},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {27:1--27:23},
  year      = {2018},
  url       = {https://doi.org/10.1145/3093239},
  doi       = {10.1145/3093239},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AbboudBHWZ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AgarwalFNSW18,
  author    = {Pankaj K. Agarwal and
               Kyle Fox and
               Abhinandan Nath and
               Anastasios Sidiropoulos and
               Yusu Wang},
  title     = {Computing the Gromov-Hausdorff Distance for Metric Trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {24:1--24:20},
  year      = {2018},
  url       = {https://doi.org/10.1145/3185466},
  doi       = {10.1145/3185466},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AgarwalFNSW18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AgarwalFS18,
  author    = {Pankaj K. Agarwal and
               Kyle Fox and
               Oren Salzman},
  title     = {An Efficient Algorithm for Computing High-Quality Paths amid Polygonal
               Obstacles},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {46:1--46:21},
  year      = {2018},
  url       = {https://doi.org/10.1145/3230650},
  doi       = {10.1145/3230650},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AgarwalFS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AhmadianBFJSS18,
  author    = {Sara Ahmadian and
               Babak Behsaz and
               Zachary Friggstad and
               Amin Jorati and
               Mohammad R. Salavatipour and
               Chaitanya Swamy},
  title     = {Approximation Algorithms for Minimum-Load \emph{k}-Facility Location},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {16:1--16:29},
  year      = {2018},
  url       = {https://doi.org/10.1145/3173047},
  doi       = {10.1145/3173047},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AhmadianBFJSS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Anagnostopoulos18,
  author    = {Evangelos Anagnostopoulos and
               Ioannis Z. Emiris and
               Ioannis Psarros},
  title     = {Randomized Embeddings with Slack and High-Dimensional Approximate
               Nearest Neighbor},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {18:1--18:21},
  year      = {2018},
  url       = {https://doi.org/10.1145/3178540},
  doi       = {10.1145/3178540},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Anagnostopoulos18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Anagnostopoulos18a,
  author    = {Aris Anagnostopoulos and
               Fabrizio Grandoni and
               Stefano Leonardi and
               Andreas Wiese},
  title     = {A Mazing 2+{\unicode{1013}} Approximation for Unsplittable Flow on
               a Path},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {55:1--55:23},
  year      = {2018},
  url       = {https://doi.org/10.1145/3242769},
  doi       = {10.1145/3242769},
  timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Anagnostopoulos18a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AngeliniLBDKRR18,
  author    = {Patrizio Angelini and
               Giordano Da Lozzo and
               Giuseppe Di Battista and
               Valentino Di Donato and
               Philipp Kindermann and
               G{\"{u}}nter Rote and
               Ignaz Rutter},
  title     = {Windrose Planarity: Embedding Graphs with Direction-Constrained Edges},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {54:1--54:24},
  year      = {2018},
  url       = {https://doi.org/10.1145/3239561},
  doi       = {10.1145/3239561},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AngeliniLBDKRR18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AronovK18,
  author    = {Boris Aronov and
               Matthew J. Katz},
  title     = {Batched Point Location in {SINR} Diagrams via Algebraic Tools},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {41:1--41:29},
  year      = {2018},
  url       = {https://doi.org/10.1145/3209678},
  doi       = {10.1145/3209678},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AronovK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AshokFKSZ18,
  author    = {Pradeesha Ashok and
               Fedor V. Fomin and
               Sudeshna Kolay and
               Saket Saurabh and
               Meirav Zehavi},
  title     = {Exact Algorithms for Terrain Guarding},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {25:1--25:20},
  year      = {2018},
  url       = {https://doi.org/10.1145/3186897},
  doi       = {10.1145/3186897},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AshokFKSZ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BarbayP18,
  author    = {J{\'{e}}r{\'{e}}my Barbay and
               Pablo P{\'{e}}rez{-}Lantero},
  title     = {Adaptive Computation of the Swap-Insert Correction Distance},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {49:1--49:16},
  year      = {2018},
  url       = {https://doi.org/10.1145/3232057},
  doi       = {10.1145/3232057},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BarbayP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BarberoPP18,
  author    = {Florian Barbero and
               Christophe Paul and
               Michal Pilipczuk},
  title     = {Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete
               Digraphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {38:1--38:31},
  year      = {2018},
  url       = {https://doi.org/10.1145/3196276},
  doi       = {10.1145/3196276},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BarberoPP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BergGM18,
  author    = {Mark de Berg and
               Joachim Gudmundsson and
               Mehran Mehr},
  title     = {Faster Algorithms for Computing Plurality Points},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {36:1--36:23},
  year      = {2018},
  url       = {https://doi.org/10.1145/3186990},
  doi       = {10.1145/3186990},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BergGM18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BhattacharyyaGN18,
  author    = {Arnab Bhattacharyya and
               Fabrizio Grandoni and
               Aleksandar Nikolov and
               Barna Saha and
               Saket Saurabh and
               Aravindan Vijayaraghavan and
               Qin Zhang},
  title     = {Editorial: {ACM-SIAM} Symposium on Discrete Algorithms {(SODA)} 2016
               Special Issue},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {26:1--26:2},
  year      = {2018},
  url       = {https://doi.org/10.1145/3230647},
  doi       = {10.1145/3230647},
  timestamp = {Sun, 20 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BhattacharyyaGN18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BienkowskiJKK18,
  author    = {Marcin Bienkowski and
               Tomasz Jurdzinski and
               Miroslaw Korzeniowski and
               Dariusz R. Kowalski},
  title     = {Distributed Online and Stochastic Queueing on a Multiple Access Channel},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {21:1--21:22},
  year      = {2018},
  url       = {https://doi.org/10.1145/3182396},
  doi       = {10.1145/3182396},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BienkowskiJKK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BliznetsFPP18,
  author    = {Ivan Bliznets and
               Fedor V. Fomin and
               Marcin Pilipczuk and
               Michal Pilipczuk},
  title     = {Subexponential Parameterized Algorithm for Interval Completion},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {35:1--35:62},
  year      = {2018},
  url       = {https://doi.org/10.1145/3186896},
  doi       = {10.1145/3186896},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BliznetsFPP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BoissonnatS18,
  author    = {Jean{-}Daniel Boissonnat and
               {Karthik {C. S.}}},
  title     = {An Efficient Representation for Filtrations of Simplicial Complexes},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {44:1--44:21},
  year      = {2018},
  url       = {https://doi.org/10.1145/3229146},
  doi       = {10.1145/3229146},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BoissonnatS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BuchbinderF18,
  author    = {Niv Buchbinder and
               Moran Feldman},
  title     = {Deterministic Algorithms for Submodular Maximization Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {32:1--32:20},
  year      = {2018},
  url       = {https://doi.org/10.1145/3184990},
  doi       = {10.1145/3184990},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BuchbinderF18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CHAN18,
  author    = {Timothy M. Chan},
  title     = {Improved Deterministic Algorithms for Linear Programming in Low Dimensions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {30:1--30:10},
  year      = {2018},
  url       = {https://doi.org/10.1145/3155312},
  doi       = {10.1145/3155312},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CHAN18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChanCW18,
  author    = {T.{-}H. Hubert Chan and
               Fei Chen and
               Xiaowei Wu},
  title     = {Analyzing Node-Weighted Oblivious Matching Problem via Continuous
               {LP} with Jump Discontinuity},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {12:1--12:25},
  year      = {2018},
  url       = {https://doi.org/10.1145/3168008},
  doi       = {10.1145/3168008},
  timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChanCW18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChanHJKT18,
  author    = {T.{-}H. Hubert Chan and
               Zhiyi Huang and
               Shaofeng H.{-}C. Jiang and
               Ning Kang and
               Zhihao Gavin Tang},
  title     = {Online Submodular Maximization with Free Disposal},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {56:1--56:29},
  year      = {2018},
  url       = {https://doi.org/10.1145/3242770},
  doi       = {10.1145/3242770},
  timestamp = {Wed, 08 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChanHJKT18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChanJ18,
  author    = {T.{-}H. Hubert Chan and
               Shaofeng H.{-}C. Jiang},
  title     = {Reducing Curse of Dimensionality: Improved {PTAS} for {TSP} (with
               Neighborhoods) in Doubling Metrics},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {1},
  pages     = {9:1--9:18},
  year      = {2018},
  url       = {https://doi.org/10.1145/3158232},
  doi       = {10.1145/3158232},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChanJ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChanMR18,
  author    = {Timothy M. Chan and
               J. Ian Munro and
               Venkatesh Raman},
  title     = {Selection and Sorting in the "Restore" Model},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {11:1--11:18},
  year      = {2018},
  url       = {https://doi.org/10.1145/3168005},
  doi       = {10.1145/3168005},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChanMR18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChechikW18,
  author    = {Shiri Chechik and
               Christian Wulff{-}Nilsen},
  title     = {Near-Optimal Light Spanners},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {33:1--33:15},
  year      = {2018},
  url       = {https://doi.org/10.1145/3199607},
  doi       = {10.1145/3199607},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChechikW18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChenZ18,
  author    = {Lin Chen and
               Guochuan Zhang},
  title     = {Packing Groups of Items into Multiple Knapsacks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {51:1--51:24},
  year      = {2018},
  url       = {https://doi.org/10.1145/3233524},
  doi       = {10.1145/3233524},
  timestamp = {Mon, 30 Mar 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChenZ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChowdhuryR18,
  author    = {Rezaul Alam Chowdhury and
               Vijaya Ramachandran},
  title     = {Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest
               Paths in Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {1},
  pages     = {1:1--1:33},
  year      = {2018},
  url       = {https://doi.org/10.1145/3147172},
  doi       = {10.1145/3147172},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChowdhuryR18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Cohen18,
  author    = {Edith Cohen},
  title     = {Stream Sampling Framework and Application for Frequency Cap Statistics},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {52:1--52:40},
  year      = {2018},
  url       = {https://doi.org/10.1145/3234338},
  doi       = {10.1145/3234338},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Cohen18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DevanurH18,
  author    = {Nikhil R. Devanur and
               Zhiyi Huang},
  title     = {Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {1},
  pages     = {5:1--5:30},
  year      = {2018},
  url       = {https://doi.org/10.1145/3155297},
  doi       = {10.1145/3155297},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/DevanurH18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DuanPS18,
  author    = {Ran Duan and
               Seth Pettie and
               Hsin{-}Hao Su},
  title     = {Scaling Algorithms for Weighted Matching in General Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {1},
  pages     = {8:1--8:35},
  year      = {2018},
  url       = {https://doi.org/10.1145/3155301},
  doi       = {10.1145/3155301},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DuanPS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein18,
  author    = {David Eppstein},
  title     = {The Parametric Closure Problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {1},
  pages     = {2:1--2:22},
  year      = {2018},
  url       = {https://doi.org/10.1145/3147212},
  doi       = {10.1145/3147212},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Eppstein18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EsfandiariHLMO18,
  author    = {Hossein Esfandiari and
               MohammadTaghi Hajiaghayi and
               Vahid Liaghat and
               Morteza Monemizadeh and
               Krzysztof Onak},
  title     = {Streaming Algorithms for Estimating the Matching Size in Planar Graphs
               and Beyond},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {48:1--48:23},
  year      = {2018},
  url       = {https://doi.org/10.1145/3230819},
  doi       = {10.1145/3230819},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EsfandiariHLMO18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FominLSPW18,
  author    = {Fedor V. Fomin and
               Daniel Lokshtanov and
               Saket Saurabh and
               Michal Pilipczuk and
               Marcin Wrochna},
  title     = {Fully Polynomial-Time Parameterized Computations for Graphs and Matrices
               of Low Treewidth},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {34:1--34:45},
  year      = {2018},
  url       = {https://doi.org/10.1145/3186898},
  doi       = {10.1145/3186898},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FominLSPW18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FominLST18,
  author    = {Fedor V. Fomin and
               Daniel Lokshtanov and
               Saket Saurabh and
               Dimitrios M. Thilikos},
  title     = {Kernels for (Connected) Dominating Set on Graphs with Excluded Topological
               Minors},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {1},
  pages     = {6:1--6:31},
  year      = {2018},
  url       = {https://doi.org/10.1145/3155298},
  doi       = {10.1145/3155298},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FominLST18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Gabow18,
  author    = {Harold N. Gabow},
  title     = {Data Structures for Weighted Matching and Extensions to \emph{b}-matching
               and \emph{f}-factors},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {39:1--39:80},
  year      = {2018},
  url       = {https://doi.org/10.1145/3183369},
  doi       = {10.1145/3183369},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Gabow18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GoldS18,
  author    = {Omer Gold and
               Micha Sharir},
  title     = {Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic
               Barrier},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {50:1--50:17},
  year      = {2018},
  url       = {https://doi.org/10.1145/3230734},
  doi       = {10.1145/3230734},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GoldS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GoranciHT18,
  author    = {Gramoz Goranci and
               Monika Henzinger and
               Mikkel Thorup},
  title     = {Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {17:1--17:21},
  year      = {2018},
  url       = {https://doi.org/10.1145/3174803},
  doi       = {10.1145/3174803},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GoranciHT18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Harris18,
  author    = {David G. Harris},
  title     = {Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas
               and the Lov{\'{a}}sz Local Lemma},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {47:1--47:24},
  year      = {2018},
  url       = {https://doi.org/10.1145/3230651},
  doi       = {10.1145/3230651},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Harris18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HeldS18,
  author    = {Stephan Held and
               Sophie Theresa Spirkl},
  title     = {Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size,
               and Fan-Out Two},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {1},
  pages     = {4:1--4:18},
  year      = {2018},
  url       = {https://doi.org/10.1145/3147215},
  doi       = {10.1145/3147215},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HeldS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HopkinsKPRS18,
  author    = {Samuel B. Hopkins and
               Pravesh Kothari and
               Aaron Henry Potechin and
               Prasad Raghavendra and
               Tselil Schramm},
  title     = {On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {28:1--28:31},
  year      = {2018},
  url       = {https://doi.org/10.1145/3178538},
  doi       = {10.1145/3178538},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HopkinsKPRS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HujdurovicHMRT18,
  author    = {Ademir Hujdurovic and
               Edin Husic and
               Martin Milanic and
               Romeo Rizzi and
               Alexandru I. Tomescu},
  title     = {Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization
               of Dilworth's Theorem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {20:1--20:26},
  year      = {2018},
  url       = {https://doi.org/10.1145/3182178},
  doi       = {10.1145/3182178},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HujdurovicHMRT18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KannanMZ18,
  author    = {Sampath Kannan and
               Claire Mathieu and
               Hang Zhou},
  title     = {Graph Reconstruction and Verification},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {40:1--40:30},
  year      = {2018},
  url       = {https://doi.org/10.1145/3199606},
  doi       = {10.1145/3199606},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KannanMZ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KarppaKK18,
  author    = {Matti Karppa and
               Petteri Kaski and
               Jukka Kohonen},
  title     = {A Faster Subquadratic Algorithm for Finding Outlier Correlations},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {31:1--31:26},
  year      = {2018},
  url       = {https://doi.org/10.1145/3174804},
  doi       = {10.1145/3174804},
  timestamp = {Fri, 14 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KarppaKK18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KormanR18,
  author    = {Amos Korman and
               Yoav Rodeh},
  title     = {The Dependent Doors Problem: An Investigation into Sequential Decisions
               without Feedback},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {43:1--43:23},
  year      = {2018},
  url       = {https://doi.org/10.1145/3218819},
  doi       = {10.1145/3218819},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KormanR18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KrauthgamerT18,
  author    = {Robert Krauthgamer and
               Ohad Trabelsi},
  title     = {Conditional Lower Bounds for All-Pairs Max-Flow},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {42:1--42:15},
  year      = {2018},
  url       = {https://doi.org/10.1145/3212510},
  doi       = {10.1145/3212510},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KrauthgamerT18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LokshtanovMPS18,
  author    = {Daniel Lokshtanov and
               Pranabendu Misra and
               Fahad Panolan and
               Saket Saurabh},
  title     = {Deterministic Truncation of Linear Matroids},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {14:1--14:20},
  year      = {2018},
  url       = {https://doi.org/10.1145/3170444},
  doi       = {10.1145/3170444},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LokshtanovMPS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LokshtanovMS18,
  author    = {Daniel Lokshtanov and
               D{\'{a}}niel Marx and
               Saket Saurabh},
  title     = {Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {13:1--13:30},
  year      = {2018},
  url       = {https://doi.org/10.1145/3170442},
  doi       = {10.1145/3170442},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LokshtanovMS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LokshtanovPL18,
  author    = {Daniel Lokshtanov and
               Marcin Pilipczuk and
               Erik Jan van Leeuwen},
  title     = {Independence and Efficient Domination on \emph{P}\({}_{\mbox{6}}\)-free
               Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {1},
  pages     = {3:1--3:30},
  year      = {2018},
  url       = {https://doi.org/10.1145/3147214},
  doi       = {10.1145/3147214},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/LokshtanovPL18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LokshtanovRS18,
  author    = {Daniel Lokshtanov and
               M. S. Ramanujan and
               Saket Saurabh},
  title     = {Linear Time Parameterized Algorithms for Subset Feedback Vertex Set},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {1},
  pages     = {7:1--7:37},
  year      = {2018},
  url       = {https://doi.org/10.1145/3155299},
  doi       = {10.1145/3155299},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LokshtanovRS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MutzeN18,
  author    = {Torsten M{\"{u}}tze and
               Jerri Nummenpalo},
  title     = {Efficient Computation of Middle Levels Gray Codes},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {15:1--15:29},
  year      = {2018},
  url       = {https://doi.org/10.1145/3170443},
  doi       = {10.1145/3170443},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MutzeN18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NewmanRS18,
  author    = {Alantha Newman and
               Heiko R{\"{o}}glin and
               Johanna Seif},
  title     = {The Alternating Stock Size Problem and the Gasoline Puzzle},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {19:1--19:23},
  year      = {2018},
  url       = {https://doi.org/10.1145/3178539},
  doi       = {10.1145/3178539},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/NewmanRS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Nutov18,
  author    = {Zeev Nutov},
  title     = {Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable
               Bifamilies},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {37:1--37:8},
  year      = {2018},
  url       = {https://doi.org/10.1145/3186991},
  doi       = {10.1145/3186991},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Nutov18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Pagh18,
  author    = {Rasmus Pagh},
  title     = {CoveringLSH: Locality-Sensitive Hashing without False Negatives},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {3},
  pages     = {29:1--29:17},
  year      = {2018},
  url       = {https://doi.org/10.1145/3155300},
  doi       = {10.1145/3155300},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Pagh18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ParterP18,
  author    = {Merav Parter and
               David Peleg},
  title     = {Fault-Tolerant Approximate {BFS} Structures},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {1},
  pages     = {10:1--10:15},
  year      = {2018},
  url       = {https://doi.org/10.1145/3022730},
  doi       = {10.1145/3022730},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ParterP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PilipczukPSL18,
  author    = {Marcin Pilipczuk and
               Michal Pilipczuk and
               Piotr Sankowski and
               Erik Jan van Leeuwen},
  title     = {Network Sparsification for Steiner Problems on Planar and Bounded-Genus
               Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {53:1--53:73},
  year      = {2018},
  url       = {https://doi.org/10.1145/3239560},
  doi       = {10.1145/3239560},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/PilipczukPSL18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SchmidS18,
  author    = {Andreas Schmid and
               Jens M. Schmidt},
  title     = {Computing 2-Walks in Polynomial Time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {22:1--22:18},
  year      = {2018},
  url       = {https://doi.org/10.1145/3183368},
  doi       = {10.1145/3183368},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/SchmidS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/TamakiY18,
  author    = {Suguru Tamaki and
               Yuichi Yoshida},
  title     = {Approximation Guarantees for the Minimum Linear Arrangement Problem
               by Higher Eigenvalues},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {4},
  pages     = {45:1--45:13},
  year      = {2018},
  url       = {https://doi.org/10.1145/3228342},
  doi       = {10.1145/3228342},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/TamakiY18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/WeiY18,
  author    = {Zhewei Wei and
               Ke Yi},
  title     = {Tight Space Bounds for Two-Dimensional Approximate Range Counting},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {14},
  number    = {2},
  pages     = {23:1--23:17},
  year      = {2018},
  url       = {https://doi.org/10.1145/3205454},
  doi       = {10.1145/3205454},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/WeiY18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AmanatidisMNS17,
  author    = {Georgios Amanatidis and
               Evangelos Markakis and
               Afshin Nikzad and
               Amin Saberi},
  title     = {Approximation Algorithms for Computing Maximin Share Allocations},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {52:1--52:28},
  year      = {2017},
  url       = {https://doi.org/10.1145/3147173},
  doi       = {10.1145/3147173},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AmanatidisMNS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AnNS17,
  author    = {Hyung{-}Chan An and
               Ashkan Norouzi{-}Fard and
               Ola Svensson},
  title     = {Dynamic Facility Location via Exponential Clocks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {21:1--21:20},
  year      = {2017},
  url       = {https://doi.org/10.1145/2928272},
  doi       = {10.1145/2928272},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AnNS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AndoniPP17,
  author    = {Alexandr Andoni and
               Debmalya Panigrahi and
               Marcin Pilipczuk},
  title     = {Editorial},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {18:1},
  year      = {2017},
  url       = {https://doi.org/10.1145/3038922},
  doi       = {10.1145/3038922},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AndoniPP17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AnnamalaiKS17,
  author    = {Chidambaram Annamalai and
               Christos Kalaitzis and
               Ola Svensson},
  title     = {Combinatorial Algorithm for Restricted Max-Min Fair Allocation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {37:1--37:28},
  year      = {2017},
  url       = {https://doi.org/10.1145/3070694},
  doi       = {10.1145/3070694},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AnnamalaiKS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BacherBHT17,
  author    = {Axel Bacher and
               Olivier Bodini and
               Hsien{-}Kuei Hwang and
               Tsung{-}Hsi Tsai},
  title     = {Generating Random Permutations by Coin Tossing: Classical Algorithms,
               New Analysis, and Modern Implementation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {24:1--24:43},
  year      = {2017},
  url       = {https://doi.org/10.1145/3009909},
  doi       = {10.1145/3009909},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BacherBHT17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BenderFFFG17,
  author    = {Michael A. Bender and
               Martin Farach{-}Colton and
               S{\'{a}}ndor P. Fekete and
               Jeremy T. Fineman and
               Seth Gilbert},
  title     = {Cost-Oblivious Storage Reallocation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {38:1--38:20},
  year      = {2017},
  url       = {https://doi.org/10.1145/3070693},
  doi       = {10.1145/3070693},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BenderFFFG17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BjorklundKK17,
  author    = {Andreas Bj{\"{o}}rklund and
               Petteri Kaski and
               Lukasz Kowalik},
  title     = {Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle
               Time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {48:1--48:26},
  year      = {2017},
  url       = {https://doi.org/10.1145/3125500},
  doi       = {10.1145/3125500},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BjorklundKK17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BorodinJLY17,
  author    = {Allan Borodin and
               Aadhar Jain and
               Hyun Chul Lee and
               Yuli Ye},
  title     = {Max-Sum Diversification, Monotone Submodular Functions, and Dynamic
               Updates},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {41:1--41:25},
  year      = {2017},
  url       = {https://doi.org/10.1145/3086464},
  doi       = {10.1145/3086464},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BorodinJLY17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ByrkaPRST17,
  author    = {Jaroslaw Byrka and
               Thomas W. Pensyl and
               Bartosz Rybicki and
               Aravind Srinivasan and
               Khoa Trinh},
  title     = {An Improved Approximation for \emph{k}-Median and Positive Correlation
               in Budgeted Optimization},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {23:1--23:31},
  year      = {2017},
  url       = {https://doi.org/10.1145/2981561},
  doi       = {10.1145/2981561},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ByrkaPRST17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Censor-HillelGG17,
  author    = {Keren Censor{-}Hillel and
               Mohsen Ghaffari and
               George Giakkoupis and
               Bernhard Haeupler and
               Fabian Kuhn},
  title     = {Tight Bounds on Vertex Connectivity Under Sampling},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {19:1--19:26},
  year      = {2017},
  url       = {https://doi.org/10.1145/3086465},
  doi       = {10.1145/3086465},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Censor-HillelGG17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChakrabartyDJS17,
  author    = {Deeparnab Chakrabarty and
               Kashyap Dixit and
               Madhav Jha and
               C. Seshadhri},
  title     = {Property Testing on Product Distributions: Optimal Testers for Bounded
               Derivative Properties},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {20:1--20:30},
  year      = {2017},
  url       = {https://doi.org/10.1145/3039241},
  doi       = {10.1145/3039241},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChakrabartyDJS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChengJL17,
  author    = {Siu{-}Wing Cheng and
               Jiongxin Jin and
               Man{-}Kit Lau},
  title     = {A Fast and Simple Surface Reconstruction Algorithm},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {27:1--27:30},
  year      = {2017},
  url       = {https://doi.org/10.1145/3039242},
  doi       = {10.1145/3039242},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChengJL17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CheraghchiI17,
  author    = {Mahdi Cheraghchi and
               Piotr Indyk},
  title     = {Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {34:1--34:36},
  year      = {2017},
  url       = {https://doi.org/10.1145/3029050},
  doi       = {10.1145/3029050},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CheraghchiI17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CohaviD17,
  author    = {Keren Cohavi and
               Shahar Dobzinski},
  title     = {Faster and Simpler Sketches of Valuation Functions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {30:1--30:9},
  year      = {2017},
  url       = {https://doi.org/10.1145/3039871},
  doi       = {10.1145/3039871},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CohaviD17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganGH17,
  author    = {Marek Cygan and
               Fabrizio Grandoni and
               Danny Hermelin},
  title     = {Tight Kernel Bounds for Problems on Graphs with Small Degeneracy},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {43:1--43:22},
  year      = {2017},
  url       = {https://doi.org/10.1145/3108239},
  doi       = {10.1145/3108239},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CyganGH17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DinitzKN17,
  author    = {Michael Dinitz and
               Guy Kortsarz and
               Zeev Nutov},
  title     = {Improved Approximation Algorithm for Steiner \emph{k}-Forest with
               Nearly Uniform Weights},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {40:1--40:16},
  year      = {2017},
  url       = {https://doi.org/10.1145/3077581},
  doi       = {10.1145/3077581},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DinitzKN17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Elmasry17,
  author    = {Amr Elmasry},
  title     = {Toward Optimal Self-Adjusting Heaps},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {55:1--55:14},
  year      = {2017},
  url       = {https://doi.org/10.1145/3147138},
  doi       = {10.1145/3147138},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Elmasry17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EtscheidR17,
  author    = {Michael Etscheid and
               Heiko R{\"{o}}glin},
  title     = {Smoothed Analysis of Local Search for the Maximum-Cut Problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {25:1--25:12},
  year      = {2017},
  url       = {https://doi.org/10.1145/3011870},
  doi       = {10.1145/3011870},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EtscheidR17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Feldman17,
  author    = {Moran Feldman},
  title     = {Maximizing Symmetric Submodular Functions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {39:1--39:36},
  year      = {2017},
  url       = {https://doi.org/10.1145/3070685},
  doi       = {10.1145/3070685},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Feldman17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FominLPS17,
  author    = {Fedor V. Fomin and
               Daniel Lokshtanov and
               Fahad Panolan and
               Saket Saurabh},
  title     = {Representative Families of Product Families},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {36:1--36:29},
  year      = {2017},
  url       = {https://doi.org/10.1145/3039243},
  doi       = {10.1145/3039243},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FominLPS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Fukunaga17,
  author    = {Takuro Fukunaga},
  title     = {Spider Covers for Prize-Collecting Network Activation Problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {49:1--49:31},
  year      = {2017},
  url       = {https://doi.org/10.1145/3132742},
  doi       = {10.1145/3132742},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Fukunaga17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Gabow17,
  author    = {Harold N. Gabow},
  title     = {A Data Structure for Nearest Common Ancestors with Linking},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {45:1--45:28},
  year      = {2017},
  url       = {https://doi.org/10.1145/3108240},
  doi       = {10.1145/3108240},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Gabow17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GanianRS17,
  author    = {Robert Ganian and
               M. S. Ramanujan and
               Stefan Szeider},
  title     = {Discovering Archipelagos of Tractability for Constraint Satisfaction
               and Counting},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {29:1--29:32},
  year      = {2017},
  url       = {https://doi.org/10.1145/3014587},
  doi       = {10.1145/3014587},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GanianRS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GaspersS17,
  author    = {Serge Gaspers and
               Gregory B. Sorkin},
  title     = {Separate, Measure and Conquer: Faster Polynomial-Space Algorithms
               for Max 2-CSP and Counting Dominating Sets},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {44:1--44:36},
  year      = {2017},
  url       = {https://doi.org/10.1145/3111499},
  doi       = {10.1145/3111499},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GaspersS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GiannopoulouJLS17,
  author    = {Archontia C. Giannopoulou and
               Bart M. P. Jansen and
               Daniel Lokshtanov and
               Saket Saurabh},
  title     = {Uniform Kernelization Complexity of Hitting Forbidden Minors},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {35:1--35:35},
  year      = {2017},
  url       = {https://doi.org/10.1145/3029051},
  doi       = {10.1145/3029051},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GiannopoulouJLS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GilbertLPS17,
  author    = {Anna C. Gilbert and
               Yi Li and
               Ely Porat and
               Martin J. Strauss},
  title     = {For-All Sparse Recovery in Near-Optimal Time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {32:1--32:26},
  year      = {2017},
  url       = {https://doi.org/10.1145/3039872},
  doi       = {10.1145/3039872},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GilbertLPS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GlacetMP17,
  author    = {Christian Glacet and
               Avery Miller and
               Andrzej Pelc},
  title     = {Time vs. Information Tradeoffs for Leader Election in Anonymous Trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {31:1--31:41},
  year      = {2017},
  url       = {https://doi.org/10.1145/3039870},
  doi       = {10.1145/3039870},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GlacetMP17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GrossiINRR17,
  author    = {Roberto Grossi and
               John Iacono and
               Gonzalo Navarro and
               Rajeev Raman and
               S. Srinivasa Rao},
  title     = {Asymptotically Optimal Encodings of Range Data Structures for Selection
               and Top-\emph{k} Queries},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {28:1--28:31},
  year      = {2017},
  url       = {https://doi.org/10.1145/3012939},
  doi       = {10.1145/3012939},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GrossiINRR17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HaeuplerH17,
  author    = {Bernhard Haeupler and
               David G. Harris},
  title     = {Parallel Algorithms and Concentration Bounds for the Lov{\'{a}}sz
               Local Lemma via Witness DAGs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {53:1--53:25},
  year      = {2017},
  url       = {https://doi.org/10.1145/3147211},
  doi       = {10.1145/3147211},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HaeuplerH17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HansenKTZ17,
  author    = {Thomas Dueholm Hansen and
               Haim Kaplan and
               Robert E. Tarjan and
               Uri Zwick},
  title     = {Hollow Heaps},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {42:1--42:27},
  year      = {2017},
  url       = {https://doi.org/10.1145/3093240},
  doi       = {10.1145/3093240},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HansenKTZ17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HarrisS17,
  author    = {David G. Harris and
               Aravind Srinivasan},
  title     = {Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {33:1--33:40},
  year      = {2017},
  url       = {https://doi.org/10.1145/3039869},
  doi       = {10.1145/3039869},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HarrisS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HenzingerKN17,
  author    = {Monika Henzinger and
               Sebastian Krinninger and
               Danupon Nanongkai},
  title     = {Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially
               Dynamic Networks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {51:1--51:24},
  year      = {2017},
  url       = {https://doi.org/10.1145/3146550},
  doi       = {10.1145/3146550},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/HenzingerKN17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HwangJT17,
  author    = {Hsien{-}Kuei Hwang and
               Svante Janson and
               Tsung{-}Hsi Tsai},
  title     = {Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence
               Dividing at Half: Theory and Applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {47:1--47:43},
  year      = {2017},
  url       = {https://doi.org/10.1145/3127585},
  doi       = {10.1145/3127585},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/HwangJT17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KaplanMNS17,
  author    = {Haim Kaplan and
               Shay Mozes and
               Yahav Nussbaum and
               Micha Sharir},
  title     = {Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices,
               and Their Applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {26:1--26:42},
  year      = {2017},
  url       = {https://doi.org/10.1145/3039873},
  doi       = {10.1145/3039873},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/KaplanMNS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Li17,
  author    = {Shi Li},
  title     = {On Uniform Capacitated \emph{k}-Median Beyond the Natural {LP} Relaxation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {22:1--22:18},
  year      = {2017},
  url       = {https://doi.org/10.1145/2983633},
  doi       = {10.1145/2983633},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Li17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MakarychevS17,
  author    = {Konstantin Makarychev and
               Maxim Sviridenko},
  title     = {Maximizing Polynomials Subject to Assignment Constraints},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {54:1--54:15},
  year      = {2017},
  url       = {https://doi.org/10.1145/3147137},
  doi       = {10.1145/3147137},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MakarychevS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RamanujanS17,
  author    = {M. S. Ramanujan and
               Saket Saurabh},
  title     = {Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {46:1--46:25},
  year      = {2017},
  url       = {https://doi.org/10.1145/3128600},
  doi       = {10.1145/3128600},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RamanujanS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ShiCRS17,
  author    = {Elaine Shi and
               T.{-}H. Hubert Chan and
               Eleanor Gilbert Rieffel and
               Dawn Song},
  title     = {Distributed Private Data Analysis: Lower Bounds and Practical Constructions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {4},
  pages     = {50:1--50:38},
  year      = {2017},
  url       = {https://doi.org/10.1145/3146549},
  doi       = {10.1145/3146549},
  timestamp = {Thu, 09 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ShiCRS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/0001MZ16,
  author    = {Meng He and
               J. Ian Munro and
               Gelin Zhou},
  title     = {Data Structures for Path Queries},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {53:1--53:32},
  year      = {2016},
  url       = {https://doi.org/10.1145/2905368},
  doi       = {10.1145/2905368},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/0001MZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/0002LPRRSS16,
  author    = {Eun Jung Kim and
               Alexander Langer and
               Christophe Paul and
               Felix Reidl and
               Peter Rossmanith and
               Ignasi Sau and
               Somnath Sikdar},
  title     = {Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {21:1--21:41},
  year      = {2016},
  url       = {https://doi.org/10.1145/2797140},
  doi       = {10.1145/2797140},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/0002LPRRSS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AbrahamCGP16,
  author    = {Ittai Abraham and
               Shiri Chechik and
               Cyril Gavoille and
               David Peleg},
  title     = {Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {22:1--22:17},
  year      = {2016},
  url       = {https://doi.org/10.1145/2818694},
  doi       = {10.1145/2818694},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AbrahamCGP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AdanyFHKSSST16,
  author    = {Ron Adany and
               Moran Feldman and
               Elad Haramaty and
               Rohit Khandekar and
               Baruch Schieber and
               Roy Schwartz and
               Hadas Shachnai and
               Tami Tamir},
  title     = {All-Or-Nothing Generalized Assignment with Application to Scheduling
               Advertising Campaigns},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {38:1--38:25},
  year      = {2016},
  url       = {https://doi.org/10.1145/2843944},
  doi       = {10.1145/2843944},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AdanyFHKSSST16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AgarwalAHPYZ16,
  author    = {Pankaj K. Agarwal and
               Boris Aronov and
               Sariel Har{-}Peled and
               Jeff M. Phillips and
               Ke Yi and
               Wuzhou Zhang},
  title     = {Nearest-Neighbor Searching Under Uncertainty {II}},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {3:1--3:25},
  year      = {2016},
  url       = {https://doi.org/10.1145/2955098},
  doi       = {10.1145/2955098},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AgarwalAHPYZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AjtaiFHN16,
  author    = {Mikl{\'{o}}s Ajtai and
               Vitaly Feldman and
               Avinatan Hassidim and
               Jelani Nelson},
  title     = {Sorting and Selection with Imprecise Comparisons},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {19:1--19:19},
  year      = {2016},
  url       = {https://doi.org/10.1145/2701427},
  doi       = {10.1145/2701427},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AjtaiFHN16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AndoniN16,
  author    = {Alexandr Andoni and
               Huy L. Nguy{\^{e}}n},
  title     = {Width of Points in the Streaming Model},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {5:1--5:10},
  year      = {2016},
  url       = {https://doi.org/10.1145/2847259},
  doi       = {10.1145/2847259},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AndoniN16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AronovDKLS16,
  author    = {Boris Aronov and
               Anne Driemel and
               Marc J. van Kreveld and
               Maarten L{\"{o}}ffler and
               Frank Staals},
  title     = {Segmentation of Trajectories on Nonmonotone Criteria},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {26:1--26:28},
  year      = {2016},
  url       = {https://doi.org/10.1145/2660772},
  doi       = {10.1145/2660772},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AronovDKLS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AumullerD16,
  author    = {Martin Aum{\"{u}}ller and
               Martin Dietzfelbinger},
  title     = {Optimal Partitioning for Dual-Pivot Quicksort},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {18:1--18:36},
  year      = {2016},
  url       = {https://doi.org/10.1145/2743020},
  doi       = {10.1145/2743020},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AumullerD16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AumullerDK16,
  author    = {Martin Aum{\"{u}}ller and
               Martin Dietzfelbinger and
               Pascal Klaue},
  title     = {How Good Is Multi-Pivot Quicksort?},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {8:1--8:47},
  year      = {2016},
  url       = {https://doi.org/10.1145/2963102},
  doi       = {10.1145/2963102},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AumullerDK16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AustrinBG16,
  author    = {Per Austrin and
               Siavosh Benabbas and
               Konstantinos Georgiou},
  title     = {Better Balance by Being Biased: {A} 0.8776-Approximation for Max Bisection},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {2:1--2:27},
  year      = {2016},
  url       = {https://doi.org/10.1145/2907052},
  doi       = {10.1145/2907052},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AustrinBG16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BabenkoGGN16,
  author    = {Maxim A. Babenko and
               Andrew V. Goldberg and
               Anupam Gupta and
               Viswanath Nagarajan},
  title     = {Algorithms for Hub Label Optimization},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {16:1--16:17},
  year      = {2016},
  url       = {https://doi.org/10.1145/2996593},
  doi       = {10.1145/2996593},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BabenkoGGN16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BenderFGT16,
  author    = {Michael A. Bender and
               Jeremy T. Fineman and
               Seth Gilbert and
               Robert E. Tarjan},
  title     = {A New Approach to Incremental Cycle Detection and Related Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {14:1--14:22},
  year      = {2016},
  url       = {https://doi.org/10.1145/2756553},
  doi       = {10.1145/2756553},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BenderFGT16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Bille0GKSV16,
  author    = {Philip Bille and
               Johannes Fischer and
               Inge Li G{\o}rtz and
               Tsvi Kopelowitz and
               Benjamin Sach and
               Hjalte Wedel Vildh{\o}j},
  title     = {Sparse Text Indexing in Small Space},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {39:1--39:19},
  year      = {2016},
  url       = {https://doi.org/10.1145/2836166},
  doi       = {10.1145/2836166},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Bille0GKSV16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BjorklundHKKNP16,
  author    = {Andreas Bj{\"{o}}rklund and
               Thore Husfeldt and
               Petteri Kaski and
               Mikko Koivisto and
               Jesper Nederlof and
               Pekka Parviainen},
  title     = {Fast Zeta Transforms for Lattices with Few Irreducibles},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {4:1--4:19},
  year      = {2016},
  url       = {https://doi.org/10.1145/2629429},
  doi       = {10.1145/2629429},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BjorklundHKKNP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BlasiusR16,
  author    = {Thomas Bl{\"{a}}sius and
               Ignaz Rutter},
  title     = {Simultaneous PQ-Ordering with Applications to Constrained Embedding
               Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {16:1--16:46},
  year      = {2016},
  url       = {https://doi.org/10.1145/2738054},
  doi       = {10.1145/2738054},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BlasiusR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BlasiusRW16,
  author    = {Thomas Bl{\"{a}}sius and
               Ignaz Rutter and
               Dorothea Wagner},
  title     = {Optimal Orthogonal Graph Drawing with Convex Bend Costs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {33:1--33:32},
  year      = {2016},
  url       = {https://doi.org/10.1145/2838736},
  doi       = {10.1145/2838736},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BlasiusRW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BorradaileK16,
  author    = {Glencora Borradaile and
               Philip N. Klein},
  title     = {The Two-Edge Connectivity Survivable-Network Design Problem in Planar
               Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {30:1--30:29},
  year      = {2016},
  url       = {https://doi.org/10.1145/2831235},
  doi       = {10.1145/2831235},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BorradaileK16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChanGMZ16,
  author    = {T.{-}H. Hubert Chan and
               Anupam Gupta and
               Bruce M. Maggs and
               Shuheng Zhou},
  title     = {On Hierarchical Routing in Doubling Metrics},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {55:1--55:22},
  year      = {2016},
  url       = {https://doi.org/10.1145/2915183},
  doi       = {10.1145/2915183},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChanGMZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChanW16,
  author    = {Timothy M. Chan and
               Bryan T. Wilkinson},
  title     = {Adaptive and Approximate Orthogonal Range Counting},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {45:1--45:15},
  year      = {2016},
  url       = {https://doi.org/10.1145/2830567},
  doi       = {10.1145/2830567},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChanW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChengMV16,
  author    = {Siu{-}Wing Cheng and
               Liam Mencel and
               Antoine Vigneron},
  title     = {A Faster Algorithm for Computing Straight Skeletons},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {44:1--44:21},
  year      = {2016},
  url       = {https://doi.org/10.1145/2898961},
  doi       = {10.1145/2898961},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChengMV16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChuzhoyMVZ16,
  author    = {Julia Chuzhoy and
               Yury Makarychev and
               Aravindan Vijayaraghavan and
               Yuan Zhou},
  title     = {Approximation Algorithms and Hardness of the \emph{k}-Route Cut Problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {2:1--2:40},
  year      = {2016},
  url       = {https://doi.org/10.1145/2644814},
  doi       = {10.1145/2644814},
  timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChuzhoyMVZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CohenCDL16,
  author    = {Edith Cohen and
               Graham Cormode and
               Nick G. Duffield and
               Carsten Lund},
  title     = {On the Tradeoff between Stability and Fit},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {7:1--7:24},
  year      = {2016},
  url       = {https://doi.org/10.1145/2963103},
  doi       = {10.1145/2963103},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CohenCDL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganDLMNOPSW16,
  author    = {Marek Cygan and
               Holger Dell and
               Daniel Lokshtanov and
               D{\'{a}}niel Marx and
               Jesper Nederlof and
               Yoshio Okamoto and
               Ramamohan Paturi and
               Saket Saurabh and
               Magnus Wahlstr{\"{o}}m},
  title     = {On Problems as Hard as {CNF-SAT}},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {41:1--41:24},
  year      = {2016},
  url       = {https://doi.org/10.1145/2925416},
  doi       = {10.1145/2925416},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CyganDLMNOPSW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DeshpandeHK16,
  author    = {Amol Deshpande and
               Lisa Hellerstein and
               Devorah Kletenik},
  title     = {Approximation Algorithms for Stochastic Submodular Set Cover with
               Applications to Boolean Function Evaluation and Min-Knapsack},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {42:1--42:28},
  year      = {2016},
  url       = {https://doi.org/10.1145/2876506},
  doi       = {10.1145/2876506},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DeshpandeHK16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DinitzKR16,
  author    = {Michael Dinitz and
               Guy Kortsarz and
               Ran Raz},
  title     = {Label Cover Instances with Large Girth and the Hardness of Approximating
               Basic \emph{k}-Spanner},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {25:1--25:16},
  year      = {2016},
  url       = {https://doi.org/10.1145/2818375},
  doi       = {10.1145/2818375},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DinitzKR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DriemelHR16,
  author    = {Anne Driemel and
               Sariel Har{-}Peled and
               Benjamin Raichel},
  title     = {On the Expected Complexity of Voronoi Diagrams on Terrains},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {37:1--37:20},
  year      = {2016},
  url       = {https://doi.org/10.1145/2846099},
  doi       = {10.1145/2846099},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DriemelHR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DumitrescuT16,
  author    = {Adrian Dumitrescu and
               Csaba D. T{\'{o}}th},
  title     = {The Traveling Salesman Problem for Lines, Balls, and Planes},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {43:1--43:29},
  year      = {2016},
  url       = {https://doi.org/10.1145/2850418},
  doi       = {10.1145/2850418},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DumitrescuT16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EfratFMPS16,
  author    = {Alon Efrat and
               S{\'{a}}ndor P. Fekete and
               Joseph S. B. Mitchell and
               Valentin Polishchuk and
               Jukka Suomela},
  title     = {Improved Approximation Algorithms for Relay Placement},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {20:1--20:28},
  year      = {2016},
  url       = {https://doi.org/10.1145/2814938},
  doi       = {10.1145/2814938},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EfratFMPS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ElkinP16,
  author    = {Michael Elkin and
               Seth Pettie},
  title     = {A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for
               General Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {50:1--50:31},
  year      = {2016},
  url       = {https://doi.org/10.1145/2888397},
  doi       = {10.1145/2888397},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ElkinP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ElkinS16,
  author    = {Michael Elkin and
               Shay Solomon},
  title     = {Fast Constructions of Lightweight Spanners for General Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {29:1--29:21},
  year      = {2016},
  url       = {https://doi.org/10.1145/2836167},
  doi       = {10.1145/2836167},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ElkinS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EmekHR16,
  author    = {Yuval Emek and
               Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Adi Ros{\'{e}}n},
  title     = {Space-Constrained Interval Selection},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {51:1--51:32},
  year      = {2016},
  url       = {https://doi.org/10.1145/2886102},
  doi       = {10.1145/2886102},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EmekHR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EmekR16,
  author    = {Yuval Emek and
               Adi Ros{\'{e}}n},
  title     = {Semi-Streaming Set Cover},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {6:1--6:22},
  year      = {2016},
  url       = {https://doi.org/10.1145/2957322},
  doi       = {10.1145/2957322},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EmekR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EnglertRV16,
  author    = {Matthias Englert and
               Heiko R{\"{o}}glin and
               Berthold V{\"{o}}cking},
  title     = {Smoothed Analysis of the 2-Opt Algorithm for the General {TSP}},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {10:1--10:15},
  year      = {2016},
  url       = {https://doi.org/10.1145/2972953},
  doi       = {10.1145/2972953},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EnglertRV16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FerraginaV16,
  author    = {Paolo Ferragina and
               Rossano Venturini},
  title     = {Compressed Cache-Oblivious String B-Tree},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {52:1--52:17},
  year      = {2016},
  url       = {https://doi.org/10.1145/2903141},
  doi       = {10.1145/2903141},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FerraginaV16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FleischerGKKS16,
  author    = {Lisa Fleischer and
               Rahul Garg and
               Sanjiv Kapoor and
               Rohit Khandekar and
               Amin Saberi},
  title     = {A Simple and Efficient Algorithm for Computing Market Equilibria},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {34:1--34:15},
  year      = {2016},
  url       = {https://doi.org/10.1145/2905372},
  doi       = {10.1145/2905372},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FleischerGKKS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Gabow16,
  author    = {Harold N. Gabow},
  title     = {The Minset-Poset Approach to Representations of Graph Connectivity},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {24:1--24:73},
  year      = {2016},
  url       = {https://doi.org/10.1145/2764909},
  doi       = {10.1145/2764909},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Gabow16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GeorgiadisILP16,
  author    = {Loukas Georgiadis and
               Giuseppe F. Italiano and
               Luigi Laura and
               Nikos Parotsidis},
  title     = {2-Edge Connectivity in Directed Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {9:1--9:24},
  year      = {2016},
  url       = {https://doi.org/10.1145/2968448},
  doi       = {10.1145/2968448},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GeorgiadisILP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GeorgiadisT16,
  author    = {Loukas Georgiadis and
               Robert E. Tarjan},
  title     = {Dominator Tree Certification and Divergent Spanning Trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {11:1--11:42},
  year      = {2016},
  url       = {https://doi.org/10.1145/2764913},
  doi       = {10.1145/2764913},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GeorgiadisT16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GeorgiadisT16a,
  author    = {Loukas Georgiadis and
               Robert E. Tarjan},
  title     = {Addendum to "Dominator Tree Certification and Divergent Spanning Trees"},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {56:1--56:3},
  year      = {2016},
  url       = {https://doi.org/10.1145/2928271},
  doi       = {10.1145/2928271},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GeorgiadisT16a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GolovnevKM16,
  author    = {Alexander Golovnev and
               Alexander S. Kulikov and
               Ivan Mihajlin},
  title     = {Families with Infants: Speeding Up Algorithms for NP-Hard Problems
               Using {FFT}},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {35:1--35:17},
  year      = {2016},
  url       = {https://doi.org/10.1145/2847419},
  doi       = {10.1145/2847419},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GolovnevKM16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GrahamHLL16,
  author    = {Ronald L. Graham and
               Linus Hamilton and
               Ariel Levavi and
               Po{-}Shen Loh},
  title     = {Anarchy Is Free in Network Creation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {15:1--15:10},
  year      = {2016},
  url       = {https://doi.org/10.1145/2729978},
  doi       = {10.1145/2729978},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GrahamHLL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GuptaN016,
  author    = {Anupam Gupta and
               Viswanath Nagarajan and
               R. Ravi},
  title     = {Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty
               Sets},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {10:1--10:21},
  year      = {2016},
  url       = {https://doi.org/10.1145/2746226},
  doi       = {10.1145/2746226},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GuptaN016.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GuruswamiRS016,
  author    = {Venkatesan Guruswami and
               Prasad Raghavendra and
               Rishi Saket and
               Yi Wu},
  title     = {Bypassing {UGC} from Some Optimal Geometric Inapproximability Results},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {6:1--6:25},
  year      = {2016},
  url       = {https://doi.org/10.1145/2737729},
  doi       = {10.1145/2737729},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GuruswamiRS016.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HajiaghayiHLLS16,
  author    = {Mohammad Taghi Hajiaghayi and
               Wei Hu and
               Jian Li and
               Shi Li and
               Barna Saha},
  title     = {A Constant Factor Approximation Algorithm for Fault-Tolerant \emph{k}-Median},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {36:1--36:19},
  year      = {2016},
  url       = {https://doi.org/10.1145/2854153},
  doi       = {10.1145/2854153},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HajiaghayiHLLS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HajiaghayiKKK16,
  author    = {Mohammad Taghi Hajiaghayi and
               Rohit Khandekar and
               Mohammad Reza Khani and
               Guy Kortsarz},
  title     = {Approximation Algorithms for Movement Repairmen},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {54:1--54:38},
  year      = {2016},
  url       = {https://doi.org/10.1145/2908737},
  doi       = {10.1145/2908737},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HajiaghayiKKK16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Harris16,
  author    = {David G. Harris},
  title     = {Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided
               Lov{\'{a}}sz Local Lemma},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {17:1--17:26},
  year      = {2016},
  url       = {https://doi.org/10.1145/3015762},
  doi       = {10.1145/3015762},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Harris16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ImNZ16,
  author    = {Sungjin Im and
               Viswanath Nagarajan and
               Ruben van der Zwaan},
  title     = {Minimum Latency Submodular Cover},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {13:1--13:28},
  year      = {2016},
  url       = {https://doi.org/10.1145/2987751},
  doi       = {10.1145/2987751},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ImNZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KawarabayashiK16,
  author    = {Ken{-}ichi Kawarabayashi and
               Yusuke Kobayashi},
  title     = {An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem
               with Congestion Two},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {5:1--5:17},
  year      = {2016},
  url       = {https://doi.org/10.1145/2960410},
  doi       = {10.1145/2960410},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KawarabayashiK16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KonjevodRX16,
  author    = {Goran Konjevod and
               Andr{\'{e}}a W. Richa and
               Donglin Xia},
  title     = {Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {27:1--27:29},
  year      = {2016},
  url       = {https://doi.org/10.1145/2876055},
  doi       = {10.1145/2876055},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KonjevodRX16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KonradR16,
  author    = {Christian Konrad and
               Adi Ros{\'{e}}n},
  title     = {Approximating Semi-matchings in Streaming and in Two-Party Communication},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {32:1--32:21},
  year      = {2016},
  url       = {https://doi.org/10.1145/2898960},
  doi       = {10.1145/2898960},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KonradR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KortsarzN16,
  author    = {Guy Kortsarz and
               Zeev Nutov},
  title     = {A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity
               of a Graph from 1 to 2},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {23:1--23:20},
  year      = {2016},
  url       = {https://doi.org/10.1145/2786981},
  doi       = {10.1145/2786981},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KortsarzN16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KoutisLP16,
  author    = {Ioannis Koutis and
               Alex Levin and
               Richard Peng},
  title     = {Faster Spectral Sparsification and Numerical Algorithms for {SDD}
               Matrices},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {17:1--17:16},
  year      = {2016},
  url       = {https://doi.org/10.1145/2743021},
  doi       = {10.1145/2743021},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KoutisLP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KoutisW16,
  author    = {Ioannis Koutis and
               Ryan Williams},
  title     = {{LIMITS} and Applications of Group Algebras for Parameterized Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {31:1--31:18},
  year      = {2016},
  url       = {https://doi.org/10.1145/2885499},
  doi       = {10.1145/2885499},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KoutisW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KratschPR16,
  author    = {Stefan Kratsch and
               Geevarghese Philip and
               Saurabh Ray},
  title     = {Point Line Cover: The Easy Kernel is Essentially Tight},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {40:1--40:16},
  year      = {2016},
  url       = {https://doi.org/10.1145/2832912},
  doi       = {10.1145/2832912},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KratschPR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KrauthgamerW16,
  author    = {Robert Krauthgamer and
               Tal Wagner},
  title     = {Cheeger-Type Approximation for Sparsest \emph{st}-Cut},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {14:1--14:21},
  year      = {2016},
  url       = {https://doi.org/10.1145/2996799},
  doi       = {10.1145/2996799},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KrauthgamerW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KrishnaswamyS16,
  author    = {Ravishankar Krishnaswamy and
               Maxim Sviridenko},
  title     = {Inapproximability of the Multilevel Uncapacitated Facility Location
               Problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {1:1--1:25},
  year      = {2016},
  url       = {https://doi.org/10.1145/2907050},
  doi       = {10.1145/2907050},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KrishnaswamyS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KumarM0S16,
  author    = {V. S. Anil Kumar and
               Madhav V. Marathe and
               Srinivasan Parthasarathy and
               Aravind Srinivasan},
  title     = {Distributed Algorithms for End-to-End Packet Scheduling in Wireless
               Ad Hoc Networks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {28:1--28:25},
  year      = {2016},
  url       = {https://doi.org/10.1145/2812811},
  doi       = {10.1145/2812811},
  timestamp = {Wed, 06 Mar 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KumarM0S16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LubbeckeMMW16,
  author    = {Elisabeth L{\"{u}}bbecke and
               Olaf Maurer and
               Nicole Megow and
               Andreas Wiese},
  title     = {A New Approach to Online Scheduling: Approximating the Optimal Competitive
               Ratio},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {15:1--15:34},
  year      = {2016},
  url       = {https://doi.org/10.1145/2996800},
  doi       = {10.1145/2996800},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LubbeckeMMW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MorozA16,
  author    = {Guillaume Moroz and
               Boris Aronov},
  title     = {Computing the Distance between Piecewise-Linear Bivariate Functions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {3:1--3:13},
  year      = {2016},
  url       = {https://doi.org/10.1145/2847257},
  doi       = {10.1145/2847257},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/MorozA16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NeimanS16,
  author    = {Ofer Neiman and
               Shay Solomon},
  title     = {Simple Deterministic Algorithms for Fully Dynamic Maximal Matching},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {7:1--7:15},
  year      = {2016},
  url       = {https://doi.org/10.1145/2700206},
  doi       = {10.1145/2700206},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/NeimanS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ParterP16,
  author    = {Merav Parter and
               David Peleg},
  title     = {Sparse Fault-Tolerant {BFS} Structures},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {11:1--11:24},
  year      = {2016},
  url       = {https://doi.org/10.1145/2976741},
  doi       = {10.1145/2976741},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ParterP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PatrascuT16,
  author    = {Mihai Patrascu and
               Mikkel Thorup},
  title     = {On the \emph{k}-Independence Required by Linear Probing and Minwise
               Independence},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {8:1--8:27},
  year      = {2016},
  url       = {https://doi.org/10.1145/2716317},
  doi       = {10.1145/2716317},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/PatrascuT16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PolacekS16,
  author    = {Luk{\'{a}}s Pol{\'{a}}cek and
               Ola Svensson},
  title     = {Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {2},
  pages     = {13:1--13:13},
  year      = {2016},
  url       = {https://doi.org/10.1145/2818695},
  doi       = {10.1145/2818695},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/PolacekS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RabaniRSW16,
  author    = {Yuval Rabani and
               Andr{\'{e}}a W. Richa and
               Jared Saia and
               David P. Woodruff},
  title     = {Editorial to the Special Issue on SODA'12},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {1:1},
  year      = {2016},
  url       = {https://doi.org/10.1145/2846001},
  doi       = {10.1145/2846001},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RabaniRSW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Segal-HaleviHA16,
  author    = {Erel Segal{-}Halevi and
               Avinatan Hassidim and
               Yonatan Aumann},
  title     = {Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting
               with Free Disposal},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {12:1--12:32},
  year      = {2016},
  url       = {https://doi.org/10.1145/2988232},
  doi       = {10.1145/2988232},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Segal-HaleviHA16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SenTK16,
  author    = {Siddhartha Sen and
               Robert E. Tarjan and
               David Hong Kyun Kim},
  title     = {Deletion Without Rebalancing in Binary Search Trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {57:1--57:31},
  year      = {2016},
  url       = {https://doi.org/10.1145/2903142},
  doi       = {10.1145/2903142},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/SenTK16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Shallue16,
  author    = {Andrew Shallue},
  title     = {Tabulating Pseudoprimes and Tabulating Liars},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {1},
  pages     = {4:1--4:14},
  year      = {2016},
  url       = {https://doi.org/10.1145/2957759},
  doi       = {10.1145/2957759},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Shallue16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SilvaHS16,
  author    = {Marcel Kenji de Carli Silva and
               Nicholas J. A. Harvey and
               Cristiane M. Sato},
  title     = {Sparse Sums of Positive Semidefinite Matrices},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {9:1--9:17},
  year      = {2016},
  url       = {https://doi.org/10.1145/2746241},
  doi       = {10.1145/2746241},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/SilvaHS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Socala16,
  author    = {Arkadiusz Socala},
  title     = {Tight Lower Bound for the Channel Assignment Problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {48:1--48:19},
  year      = {2016},
  url       = {https://doi.org/10.1145/2876505},
  doi       = {10.1145/2876505},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Socala16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Swamy16,
  author    = {Chaitanya Swamy},
  title     = {Improved Approximation Algorithms for Matroid and Knapsack Median
               Problems and Applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {49:1--49:22},
  year      = {2016},
  url       = {https://doi.org/10.1145/2963170},
  doi       = {10.1145/2963170},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Swamy16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/WardZ16,
  author    = {Justin Ward and
               Stanislav Zivn{\'{y}}},
  title     = {Maximizing \emph{k}-Submodular Functions and Beyond},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {47:1--47:26},
  year      = {2016},
  url       = {https://doi.org/10.1145/2850419},
  doi       = {10.1145/2850419},
  timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/WardZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/WeimannY16,
  author    = {Oren Weimann and
               Raphael Yuster},
  title     = {Approximating the Diameter of Planar Graphs in Near Linear Time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {1},
  pages     = {12:1--12:13},
  year      = {2016},
  url       = {https://doi.org/10.1145/2764910},
  doi       = {10.1145/2764910},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/WeimannY16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Wimmer16,
  author    = {Karl Wimmer},
  title     = {Agnostic Learning in Permutation-Invariant Domains},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {4},
  pages     = {46:1--46:22},
  year      = {2016},
  url       = {https://doi.org/10.1145/2963169},
  doi       = {10.1145/2963169},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Wimmer16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AngeliniBFJKPR15,
  author    = {Patrizio Angelini and
               Giuseppe Di Battista and
               Fabrizio Frati and
               V{\'{\i}}t Jel{\'{\i}}nek and
               Jan Kratochv{\'{\i}}l and
               Maurizio Patrignani and
               Ignaz Rutter},
  title     = {Testing Planarity of Partially Embedded Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {32:1--32:42},
  year      = {2015},
  url       = {https://doi.org/10.1145/2629341},
  doi       = {10.1145/2629341},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AngeliniBFJKPR15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Avigdor-Elgrabli15,
  author    = {Noa Avigdor{-}Elgrabli and
               Yuval Rabani},
  title     = {An Improved Competitive Algorithm for Reordering Buffer Management},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {35:1--35:15},
  year      = {2015},
  url       = {https://doi.org/10.1145/2663347},
  doi       = {10.1145/2663347},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Avigdor-Elgrabli15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AvrahamFKKS15,
  author    = {Rinat Ben Avraham and
               Omrit Filtser and
               Haim Kaplan and
               Matthew J. Katz and
               Micha Sharir},
  title     = {The Discrete and Semicontinuous Fr{\'{e}}chet Distance with Shortcuts
               via Approximate Distance Counting and Selection},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {29:1--29:29},
  year      = {2015},
  url       = {https://doi.org/10.1145/2700222},
  doi       = {10.1145/2700222},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AvrahamFKKS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BelazzouguiN15,
  author    = {Djamal Belazzougui and
               Gonzalo Navarro},
  title     = {Optimal Lower and Upper Bounds for Representing Sequences},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {31:1--31:21},
  year      = {2015},
  url       = {https://doi.org/10.1145/2629339},
  doi       = {10.1145/2629339},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BelazzouguiN15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BorradaileKM15,
  author    = {Glencora Borradaile and
               Philip N. Klein and
               Claire Mathieu},
  title     = {A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {3},
  pages     = {19:1--19:20},
  year      = {2015},
  url       = {https://doi.org/10.1145/2629654},
  doi       = {10.1145/2629654},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BorradaileKM15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BorradaileSW15,
  author    = {Glencora Borradaile and
               Piotr Sankowski and
               Christian Wulff{-}Nilsen},
  title     = {Min \emph{st}-Cut Oracle for Planar Graphs with Near-Linear Preprocessing
               Time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {3},
  pages     = {16:1--16:29},
  year      = {2015},
  url       = {https://doi.org/10.1145/2684068},
  doi       = {10.1145/2684068},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BorradaileSW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CaoM15,
  author    = {Yixin Cao and
               D{\'{a}}niel Marx},
  title     = {Interval Deletion Is Fixed-Parameter Tractable},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {3},
  pages     = {21:1--21:35},
  year      = {2015},
  url       = {https://doi.org/10.1145/2629595},
  doi       = {10.1145/2629595},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CaoM15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Chalopin0DMW15,
  author    = {J{\'{e}}r{\'{e}}mie Chalopin and
               Shantanu Das and
               Yann Disser and
               Mat{\'{u}}s Mihal{\'{a}}k and
               Peter Widmayer},
  title     = {Mapping Simple Polygons: The Power of Telling Convex from Reflex},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {33:1--33:16},
  year      = {2015},
  url       = {https://doi.org/10.1145/2700223},
  doi       = {10.1145/2700223},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Chalopin0DMW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Charron-BostFWW15,
  author    = {Bernadette Charron{-}Bost and
               Matthias F{\"{u}}gger and
               Jennifer L. Welch and
               Josef Widder},
  title     = {Time Complexity of Link Reversal Routing},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {3},
  pages     = {18:1--18:39},
  year      = {2015},
  url       = {https://doi.org/10.1145/2644815},
  doi       = {10.1145/2644815},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Charron-BostFWW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChenW15,
  author    = {Danny Z. Chen and
               Haitao Wang},
  title     = {Computing Shortest Paths among Curved Obstacles in the Plane},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {26:1--26:46},
  year      = {2015},
  url       = {https://doi.org/10.1145/2660771},
  doi       = {10.1145/2660771},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChenW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChitnisCHM15,
  author    = {Rajesh Hemant Chitnis and
               Marek Cygan and
               Mohammad Taghi Hajiaghayi and
               D{\'{a}}niel Marx},
  title     = {Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {28:1--28:28},
  year      = {2015},
  url       = {https://doi.org/10.1145/2700209},
  doi       = {10.1145/2700209},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChitnisCHM15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EhsaniFFMSSS15,
  author    = {Shayan Ehsani and
               Saber Shokat Fadaee and
               MohammadAmin Fazli and
               Abbas Mehrabian and
               Sina Sadeghian Sadeghabad and
               Mohammad Ali Safari and
               Morteza Saghafian},
  title     = {A Bounded Budget Network Creation Game},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {34:1--34:25},
  year      = {2015},
  url       = {https://doi.org/10.1145/2701615},
  doi       = {10.1145/2701615},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EhsaniFFMSSS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GerkePSS15,
  author    = {Stefanie Gerke and
               Konstantinos Panagiotou and
               Justus Schwartz and
               Angelika Steger},
  title     = {Maximizing the Minimum Load for Random Processing Times},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {3},
  pages     = {17:1--17:19},
  year      = {2015},
  url       = {https://doi.org/10.1145/2651421},
  doi       = {10.1145/2651421},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GerkePSS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GortzNR15,
  author    = {Inge Li G{\o}rtz and
               Viswanath Nagarajan and
               R. Ravi},
  title     = {Minimum Makespan Multi-Vehicle Dial-a-Ride},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {3},
  pages     = {23:1--23:29},
  year      = {2015},
  url       = {https://doi.org/10.1145/2629653},
  doi       = {10.1145/2629653},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GortzNR15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HaeuplerST15,
  author    = {Bernhard Haeupler and
               Siddhartha Sen and
               Robert Endre Tarjan},
  title     = {Rank-Balanced Trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {30:1--30:26},
  year      = {2015},
  url       = {https://doi.org/10.1145/2689412},
  doi       = {10.1145/2689412},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HaeuplerST15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HohnJ15,
  author    = {Wiebke H{\"{o}}hn and
               Tobias Jacobs},
  title     = {On the Performance of Smith's Rule in Single-Machine Scheduling with
               Nonlinear Cost},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {25:1--25:30},
  year      = {2015},
  url       = {https://doi.org/10.1145/2629652},
  doi       = {10.1145/2629652},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HohnJ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Jez15,
  author    = {Artur Jez},
  title     = {Faster Fully Compressed Pattern Matching by Recompression},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {3},
  pages     = {20:1--20:43},
  year      = {2015},
  url       = {https://doi.org/10.1145/2631920},
  doi       = {10.1145/2631920},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Jez15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LeviR15,
  author    = {Reut Levi and
               Dana Ron},
  title     = {A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded
               Minor},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {3},
  pages     = {24:1--24:13},
  year      = {2015},
  url       = {https://doi.org/10.1145/2629508},
  doi       = {10.1145/2629508},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LeviR15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MarxV15,
  author    = {D{\'{a}}niel Marx and
               L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
  title     = {Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {4},
  pages     = {27:1--27:24},
  year      = {2015},
  url       = {https://doi.org/10.1145/2700210},
  doi       = {10.1145/2700210},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MarxV15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/WildNN15,
  author    = {Sebastian Wild and
               Markus E. Nebel and
               Ralph Neininger},
  title     = {Average Case and Distributional Analysis of Dual-Pivot Quicksort},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {3},
  pages     = {22:1--22:42},
  year      = {2015},
  url       = {https://doi.org/10.1145/2629340},
  doi       = {10.1145/2629340},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/WildNN15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlbersA14,
  author    = {Susanne Albers and
               Antonios Antoniadis},
  title     = {Race to idle: New algorithms for speed scaling with a sleep state},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {2},
  pages     = {9:1--9:31},
  year      = {2014},
  url       = {https://doi.org/10.1145/2556953},
  doi       = {10.1145/2556953},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlbersA14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlstrupTGRZ14,
  author    = {Stephen Alstrup and
               Mikkel Thorup and
               Inge Li G{\o}rtz and
               Theis Rauhe and
               Uri Zwick},
  title     = {Union-Find with Constant Time Deletions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {1},
  pages     = {6:1--6:28},
  year      = {2014},
  url       = {https://doi.org/10.1145/2636922},
  doi       = {10.1145/2636922},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AlstrupTGRZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AwerbuchRSSZ14,
  author    = {Baruch Awerbuch and
               Andr{\'{e}}a W. Richa and
               Christian Scheideler and
               Stefan Schmid and
               Jin Zhang},
  title     = {Principles of Robust Medium Access and an Application to Leader Election},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {4},
  pages     = {24:1--24:26},
  year      = {2014},
  url       = {https://doi.org/10.1145/2635818},
  doi       = {10.1145/2635818},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AwerbuchRSSZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BansalFKS14,
  author    = {Nikhil Bansal and
               Zachary Friggstad and
               Rohit Khandekar and
               Mohammad R. Salavatipour},
  title     = {A logarithmic approximation for unsplittable flow on line graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {1},
  pages     = {1:1--1:15},
  year      = {2014},
  url       = {https://doi.org/10.1145/2532645},
  doi       = {10.1145/2532645},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BansalFKS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BansalKN14,
  author    = {Nikhil Bansal and
               Ravishankar Krishnaswamy and
               Viswanath Nagarajan},
  title     = {Better Scalable Algorithms for Broadcast Scheduling},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {1},
  pages     = {3:1--3:24},
  year      = {2014},
  url       = {https://doi.org/10.1145/2636916},
  doi       = {10.1145/2636916},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BansalKN14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BelazzouguiN14,
  author    = {Djamal Belazzougui and
               Gonzalo Navarro},
  title     = {Alphabet-Independent Compressed Text Indexing},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {4},
  pages     = {23:1--23:19},
  year      = {2014},
  url       = {https://doi.org/10.1145/2635816},
  doi       = {10.1145/2635816},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BelazzouguiN14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BerenbrinkHS14,
  author    = {Petra Berenbrink and
               Martin Hoefer and
               Thomas Sauerwald},
  title     = {Distributed Selfish Load Balancing on Networks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {1},
  pages     = {2:1--2:29},
  year      = {2014},
  url       = {https://doi.org/10.1145/2629671},
  doi       = {10.1145/2629671},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BerenbrinkHS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BermanR14,
  author    = {Piotr Berman and
               Sofya Raskhodnikova},
  title     = {Approximation Algorithms for Min-Max Generalization Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {1},
  pages     = {5:1--5:23},
  year      = {2014},
  url       = {https://doi.org/10.1145/2636920},
  doi       = {10.1145/2636920},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BermanR14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BreslauerG14,
  author    = {Dany Breslauer and
               Zvi Galil},
  title     = {Real-Time Streaming String-Matching},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {4},
  pages     = {22:1--22:12},
  year      = {2014},
  url       = {https://doi.org/10.1145/2635814},
  doi       = {10.1145/2635814},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BreslauerG14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CaragiannisKKP14,
  author    = {Ioannis Caragiannis and
               Christos Kaklamanis and
               Nikos Karanikolas and
               Ariel D. Procaccia},
  title     = {Socially desirable approximations for dodgson's voting rule},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {2},
  pages     = {6:1--6:28},
  year      = {2014},
  url       = {https://doi.org/10.1145/2556950},
  doi       = {10.1145/2556950},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CaragiannisKKP14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChakrabartiCMT14,
  author    = {Amit Chakrabarti and
               Graham Cormode and
               Andrew McGregor and
               Justin Thaler},
  title     = {Annotations in Data Streams},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {1},
  pages     = {7:1--7:30},
  year      = {2014},
  url       = {https://doi.org/10.1145/2636924},
  doi       = {10.1145/2636924},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChakrabartiCMT14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChanN14,
  author    = {T.{-}H. Hubert Chan and
               Li Ning},
  title     = {Fast Convergence for Consensus in Dynamic Networks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {3},
  pages     = {15:1--15:15},
  year      = {2014},
  url       = {https://doi.org/10.1145/2601072},
  doi       = {10.1145/2601072},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChanN14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChenD14,
  author    = {Ning Chen and
               Xiaotie Deng},
  title     = {Envy-free pricing in multi-item markets},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {2},
  pages     = {7:1--7:15},
  year      = {2014},
  url       = {https://doi.org/10.1145/2567923},
  doi       = {10.1145/2567923},
  timestamp = {Wed, 22 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChenD14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CheriyanLNV14,
  author    = {Joseph Cheriyan and
               Bundit Laekhanukit and
               Guyslain Naves and
               Adrian Vetta},
  title     = {Approximating Rooted Steiner Networks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {2},
  pages     = {8:1--8:22},
  year      = {2014},
  url       = {https://doi.org/10.1145/2650183},
  doi       = {10.1145/2650183},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CheriyanLNV14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CheungLL14,
  author    = {Ho Yee Cheung and
               Lap Chi Lau and
               Kai Man Leung},
  title     = {Algebraic Algorithms for Linear Matroid Parity Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {3},
  pages     = {10:1--10:26},
  year      = {2014},
  url       = {https://doi.org/10.1145/2601066},
  doi       = {10.1145/2601066},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CheungLL14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ColeHLT14,
  author    = {Richard Cole and
               Carmit Hazay and
               Moshe Lewenstein and
               Dekel Tsur},
  title     = {Two-Dimensional Parameterized Matching},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {2},
  pages     = {12:1--12:30},
  year      = {2014},
  url       = {https://doi.org/10.1145/2650220},
  doi       = {10.1145/2650220},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ColeHLT14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DellHMTW14,
  author    = {Holger Dell and
               Thore Husfeldt and
               D{\'{a}}niel Marx and
               Nina Taslaman and
               Martin Wahlen},
  title     = {Exponential Time Complexity of the Permanent and the Tutte Polynomial},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {4},
  pages     = {21:1--21:32},
  year      = {2014},
  url       = {https://doi.org/10.1145/2635812},
  doi       = {10.1145/2635812},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DellHMTW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineHK14,
  author    = {Erik D. Demaine and
               Mohammad Taghi Hajiaghayi and
               Philip N. Klein},
  title     = {Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {3},
  pages     = {13:1--13:20},
  year      = {2014},
  url       = {https://doi.org/10.1145/2601070},
  doi       = {10.1145/2601070},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DemaineHK14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineHM14,
  author    = {Erik D. Demaine and
               Mohammad Taghi Hajiaghayi and
               D{\'{a}}niel Marx},
  title     = {Minimizing Movement: Fixed-Parameter Tractability},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {2},
  pages     = {14:1--14:29},
  year      = {2014},
  url       = {https://doi.org/10.1145/2650247},
  doi       = {10.1145/2650247},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DemaineHM14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DieudonneP14,
  author    = {Yoann Dieudonn{\'{e}} and
               Andrzej Pelc},
  title     = {Deterministic Network Exploration by Anonymous Silent Agents with
               Local Traffic Reports},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {2},
  pages     = {10:1--10:29},
  year      = {2014},
  url       = {https://doi.org/10.1145/2594581},
  doi       = {10.1145/2594581},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DieudonneP14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DieudonnePP14,
  author    = {Yoann Dieudonn{\'{e}} and
               Andrzej Pelc and
               David Peleg},
  title     = {Gathering Despite Mischief},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {1},
  pages     = {1:1--1:28},
  year      = {2014},
  url       = {https://doi.org/10.1145/2629656},
  doi       = {10.1145/2629656},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DieudonnePP14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DoerrFS14,
  author    = {Benjamin Doerr and
               Tobias Friedrich and
               Thomas Sauerwald},
  title     = {Quasirandom Rumor Spreading},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {2},
  pages     = {9:1--9:35},
  year      = {2014},
  url       = {https://doi.org/10.1145/2650185},
  doi       = {10.1145/2650185},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DoerrFS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DomLS14,
  author    = {Michael Dom and
               Daniel Lokshtanov and
               Saket Saurabh},
  title     = {Kernelization Lower Bounds Through Colors and IDs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {2},
  pages     = {13:1--13:20},
  year      = {2014},
  url       = {https://doi.org/10.1145/2650261},
  doi       = {10.1145/2650261},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DomLS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FakcharoenpholLN14,
  author    = {Jittat Fakcharoenphol and
               Bundit Laekhanukit and
               Danupon Nanongkai},
  title     = {Faster Algorithms for Semi-Matching Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {3},
  pages     = {14:1--14:23},
  year      = {2014},
  url       = {https://doi.org/10.1145/2601071},
  doi       = {10.1145/2601071},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FakcharoenpholLN14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FeigenbaumJS14,
  author    = {Joan Feigenbaum and
               Aaron D. Jaggard and
               Michael Schapira},
  title     = {Approximate Privacy: Foundations and Quantification},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {3},
  pages     = {11:1--11:38},
  year      = {2014},
  url       = {https://doi.org/10.1145/2601067},
  doi       = {10.1145/2601067},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FeigenbaumJS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GoelN14,
  author    = {Ashish Goel and
               Hamid Nazerzadeh},
  title     = {Price-based protocols for fair resource allocation: Convergence time
               analysis and extension to leontief utilities},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {2},
  pages     = {5:1--5:14},
  year      = {2014},
  url       = {https://doi.org/10.1145/2556949},
  doi       = {10.1145/2556949},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GoelN14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GroheM14,
  author    = {Martin Grohe and
               D{\'{a}}niel Marx},
  title     = {Constraint Solving via Fractional Edge Covers},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {1},
  pages     = {4:1--4:20},
  year      = {2014},
  url       = {https://doi.org/10.1145/2636918},
  doi       = {10.1145/2636918},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GroheM14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Har-PeledR14,
  author    = {Sariel Har{-}Peled and
               Benjamin Raichel},
  title     = {The fr{\'{e}}chet distance revisited and extended},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {1},
  pages     = {3:1--3:22},
  year      = {2014},
  url       = {https://doi.org/10.1145/2532646},
  doi       = {10.1145/2532646},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Har-PeledR14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Kratsch14,
  author    = {Stefan Kratsch},
  title     = {Co-Nondeterminism in Compositions: {A} Kernelization Lower Bound for
               a Ramsey-Type Problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {4},
  pages     = {19:1--19:16},
  year      = {2014},
  url       = {https://doi.org/10.1145/2635808},
  doi       = {10.1145/2635808},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Kratsch14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KratschW14,
  author    = {Stefan Kratsch and
               Magnus Wahlstr{\"{o}}m},
  title     = {Compression via Matroids: {A} Randomized Polynomial Kernel for Odd
               Cycle Transversal},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {4},
  pages     = {20:1--20:15},
  year      = {2014},
  url       = {https://doi.org/10.1145/2635810},
  doi       = {10.1145/2635810},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/KratschW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LokshtanovNRRS14,
  author    = {Daniel Lokshtanov and
               N. S. Narayanaswamy and
               Venkatesh Raman and
               M. S. Ramanujan and
               Saket Saurabh},
  title     = {Faster Parameterized Algorithms Using Linear Programming},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {2},
  pages     = {15:1--15:31},
  year      = {2014},
  url       = {https://doi.org/10.1145/2566616},
  doi       = {10.1145/2566616},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LokshtanovNRRS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MakarychevMS14,
  author    = {Konstantin Makarychev and
               Rajsekar Manokaran and
               Maxim Sviridenko},
  title     = {Maximum Quadratic Assignment Problem: Reduction from Maximum Label
               Cover and LP-based Approximation Algorithm},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {4},
  pages     = {18:1--18:18},
  year      = {2014},
  url       = {https://doi.org/10.1145/2629672},
  doi       = {10.1145/2629672},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MakarychevMS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Mestre14,
  author    = {Juli{\'{a}}n Mestre},
  title     = {Weighted popular matchings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {1},
  pages     = {2:1--2:16},
  year      = {2014},
  url       = {https://doi.org/10.1145/2556951},
  doi       = {10.1145/2556951},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Mestre14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NavarroS14,
  author    = {Gonzalo Navarro and
               Kunihiko Sadakane},
  title     = {Fully Functional Static and Dynamic Succinct Trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {3},
  pages     = {16:1--16:39},
  year      = {2014},
  url       = {https://doi.org/10.1145/2601073},
  doi       = {10.1145/2601073},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/NavarroS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RonT14,
  author    = {Dana Ron and
               Gilad Tsur},
  title     = {Testing Properties of Sparse Images},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {4},
  pages     = {17:1--17:52},
  year      = {2014},
  url       = {https://doi.org/10.1145/2635806},
  doi       = {10.1145/2635806},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RonT14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RueST14,
  author    = {Juanjo Ru{\'{e}} and
               Ignasi Sau and
               Dimitrios M. Thilikos},
  title     = {Dynamic programming for graphs on surfaces},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {2},
  pages     = {8:1--8:26},
  year      = {2014},
  url       = {https://doi.org/10.1145/2556952},
  doi       = {10.1145/2556952},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RueST14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Ta-ShmaZ14,
  author    = {Amnon Ta{-}Shma and
               Uri Zwick},
  title     = {Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration
               Sequences},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {3},
  pages     = {12:1--12:15},
  year      = {2014},
  url       = {https://doi.org/10.1145/2601068},
  doi       = {10.1145/2601068},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Ta-ShmaZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Tao14,
  author    = {Yufei Tao},
  title     = {Dynamic Ray Stabbing},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {2},
  pages     = {11:1--11:19},
  year      = {2014},
  url       = {https://doi.org/10.1145/2559153},
  doi       = {10.1145/2559153},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Tao14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Vigneron14,
  author    = {Antoine Vigneron},
  title     = {Geometric optimization and sums of algebraic functions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {1},
  pages     = {4:1--4:20},
  year      = {2014},
  url       = {https://doi.org/10.1145/2532647},
  doi       = {10.1145/2532647},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Vigneron14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AilonL13,
  author    = {Nir Ailon and
               Edo Liberty},
  title     = {An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {3},
  pages     = {21:1--21:12},
  year      = {2013},
  url       = {https://doi.org/10.1145/2483699.2483701},
  doi       = {10.1145/2483699.2483701},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AilonL13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AmbuhlGS13,
  author    = {Christoph Amb{\"{u}}hl and
               Bernd G{\"{a}}rtner and
               Bernhard von Stengel},
  title     = {Optimal lower bounds for projective list update algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {4},
  pages     = {31:1--31:18},
  year      = {2013},
  url       = {https://doi.org/10.1145/2500120},
  doi       = {10.1145/2500120},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AmbuhlGS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BansalCP13,
  author    = {Nikhil Bansal and
               Ho{-}Leung Chan and
               Kirk Pruhs},
  title     = {Speed Scaling with an Arbitrary Power Function},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {2},
  pages     = {18:1--18:14},
  year      = {2013},
  url       = {https://doi.org/10.1145/2438645.2438650},
  doi       = {10.1145/2438645.2438650},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BansalCP13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BateniHZ13,
  author    = {MohammadHossein Bateni and
               Mohammad Taghi Hajiaghayi and
               Morteza Zadimoghaddam},
  title     = {Submodular secretary problem and extensions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {4},
  pages     = {32:1--32:23},
  year      = {2013},
  url       = {https://doi.org/10.1145/2500121},
  doi       = {10.1145/2500121},
  timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BateniHZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BiedlLPS13,
  author    = {Therese C. Biedl and
               Anna Lubiw and
               Mark Petrick and
               Michael J. Spriggs},
  title     = {Morphing orthogonal planar graph drawings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {4},
  pages     = {29:1--29:24},
  year      = {2013},
  url       = {https://doi.org/10.1145/2500118},
  doi       = {10.1145/2500118},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BiedlLPS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Chan13,
  author    = {Timothy M. Chan},
  title     = {Persistent Predecessor Search and Orthogonal Point Location on the
               Word {RAM}},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {3},
  pages     = {22:1--22:22},
  year      = {2013},
  url       = {https://doi.org/10.1145/2483699.2483702},
  doi       = {10.1145/2483699.2483702},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Chan13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChawlaRR13,
  author    = {Shuchi Chawla and
               Prasad Raghavendra and
               Dana Randall},
  title     = {Foreword to the Special Issue on SODA'11},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {3},
  pages     = {20:1},
  year      = {2013},
  url       = {https://doi.org/10.1145/2483699.2483700},
  doi       = {10.1145/2483699.2483700},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChawlaRR13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Daskalakis13,
  author    = {Constantinos Daskalakis},
  title     = {On the Complexity of Approximating a Nash Equilibrium},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {3},
  pages     = {23:1--23:35},
  year      = {2013},
  url       = {https://doi.org/10.1145/2483699.2483703},
  doi       = {10.1145/2483699.2483703},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Daskalakis13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EisenbrandPR13,
  author    = {Friedrich Eisenbrand and
               D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
               Thomas Rothvo{\ss}},
  title     = {Bin Packing via Discrepancy of Permutations},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {3},
  pages     = {24:1--24:15},
  year      = {2013},
  url       = {https://doi.org/10.1145/2483699.2483704},
  doi       = {10.1145/2483699.2483704},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EisenbrandPR13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FraigniaudP13,
  author    = {Pierre Fraigniaud and
               Andrzej Pelc},
  title     = {Delays Induce an Exponential Memory Gap for Rendezvous in Trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {2},
  pages     = {17:1--17:24},
  year      = {2013},
  url       = {https://doi.org/10.1145/2438645.2438649},
  doi       = {10.1145/2438645.2438649},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FraigniaudP13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GandhiHKS13,
  author    = {Rajiv Gandhi and
               Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Guy Kortsarz and
               Hadas Shachnai},
  title     = {Corrigendum: Improved results for data migration and open shop scheduling},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {4},
  pages     = {34:1--34:7},
  year      = {2013},
  url       = {https://doi.org/10.1145/2500123},
  doi       = {10.1145/2500123},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GandhiHKS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Gawrychowski13,
  author    = {Pawel Gawrychowski},
  title     = {Optimal Pattern Matching in {LZW} Compressed Strings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {3},
  pages     = {25:1--25:17},
  year      = {2013},
  url       = {https://doi.org/10.1145/2483699.2483705},
  doi       = {10.1145/2483699.2483705},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Gawrychowski13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HochbaumL13,
  author    = {Dorit S. Hochbaum and
               Asaf Levin},
  title     = {Approximation Algorithms for a Minimization Variant of the Order-Preserving
               Submatrices and for Biclustering Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {2},
  pages     = {19:1--19:12},
  year      = {2013},
  url       = {https://doi.org/10.1145/2438645.2438651},
  doi       = {10.1145/2438645.2438651},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HochbaumL13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JayramW13,
  author    = {T. S. Jayram and
               David P. Woodruff},
  title     = {Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming
               Problems with Subconstant Error},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {3},
  pages     = {26:1--26:17},
  year      = {2013},
  url       = {https://doi.org/10.1145/2483699.2483706},
  doi       = {10.1145/2483699.2483706},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/JayramW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KaltofenY13,
  author    = {Erich Kaltofen and
               George Yuhasz},
  title     = {On the matrix berlekamp-massey algorithm},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {4},
  pages     = {33:1--33:24},
  year      = {2013},
  url       = {https://doi.org/10.1145/2500122},
  doi       = {10.1145/2500122},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KaltofenY13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KawarabayashiK13,
  author    = {Ken{-}ichi Kawarabayashi and
               Yusuke Kobayashi},
  title     = {An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem
               in Eulerian Planar Graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {2},
  pages     = {16:1--16:13},
  year      = {2013},
  url       = {https://doi.org/10.1145/2438645.2438648},
  doi       = {10.1145/2438645.2438648},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KawarabayashiK13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Lacki13,
  author    = {Jakub Lacki},
  title     = {Improved Deterministic Algorithms for Decremental Reachability and
               Strongly Connected Components},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {3},
  pages     = {27:1--27:15},
  year      = {2013},
  url       = {https://doi.org/10.1145/2483699.2483707},
  doi       = {10.1145/2483699.2483707},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Lacki13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MarxOR13,
  author    = {D{\'{a}}niel Marx and
               Barry O'Sullivan and
               Igor Razgon},
  title     = {Finding small separators in linear time via treewidth reduction},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {4},
  pages     = {30:1--30:35},
  year      = {2013},
  url       = {https://doi.org/10.1145/2500119},
  doi       = {10.1145/2500119},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MarxOR13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RodittyT13,
  author    = {Liam Roditty and
               Roei Tov},
  title     = {Approximating the Girth},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {2},
  pages     = {15:1--15:13},
  year      = {2013},
  url       = {https://doi.org/10.1145/2438645.2438647},
  doi       = {10.1145/2438645.2438647},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RodittyT13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Solomon13,
  author    = {Shay Solomon},
  title     = {Sparse Euclidean Spanners with Tiny Diameter},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {3},
  pages     = {28:1--28:33},
  year      = {2013},
  url       = {https://doi.org/10.1145/2483699.2483708},
  doi       = {10.1145/2483699.2483708},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Solomon13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/WeimannY13,
  author    = {Oren Weimann and
               Raphael Yuster},
  title     = {Replacement Paths and Distance Sensitivity Oracles via Fast Matrix
               Multiplication},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {2},
  pages     = {14:1--14:13},
  year      = {2013},
  url       = {https://doi.org/10.1145/2438645.2438646},
  doi       = {10.1145/2438645.2438646},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/WeimannY13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/0013STW12,
  author    = {Wei Chen and
               Christian Sommer and
               Shang{-}Hua Teng and
               Yajun Wang},
  title     = {A compact routing scheme and approximate distance oracle for power-law
               graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {4:1--4:26},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390180},
  doi       = {10.1145/2390176.2390180},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/0013STW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AgarwalCY12,
  author    = {Pankaj K. Agarwal and
               Siu{-}Wing Cheng and
               Ke Yi},
  title     = {Range searching on uncertain data},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {43:1--43:17},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344433},
  doi       = {10.1145/2344422.2344433},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AgarwalCY12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AmirELPS12,
  author    = {Amihood Amir and
               Estrella Eisenberg and
               Avivit Levy and
               Ely Porat and
               Natalie Shapira},
  title     = {Cycle detection and correction},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {13:1--13:20},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390189},
  doi       = {10.1145/2390176.2390189},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AmirELPS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AndoniK12,
  author    = {Alexandr Andoni and
               Robert Krauthgamer},
  title     = {The smoothed complexity of edit distance},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {44:1--44:25},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344434},
  doi       = {10.1145/2344422.2344434},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AndoniK12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ArvindK12,
  author    = {Vikraman Arvind and
               Piyush P. Kurur},
  title     = {Testing nilpotence of galois groups in polynomial time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {32:1--32:22},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229176},
  doi       = {10.1145/2229163.2229176},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ArvindK12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AsadpourFS12,
  author    = {Arash Asadpour and
               Uriel Feige and
               Amin Saberi},
  title     = {Santa claus meets hypergraph matchings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {24:1--24:9},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229168},
  doi       = {10.1145/2229163.2229168},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AsadpourFS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AumannLMPY12,
  author    = {Yonatan Aumann and
               Moshe Lewenstein and
               Oren Melamud and
               Ron Y. Pinter and
               Zohar Yakhini},
  title     = {Dotted interval graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {9:1--9:21},
  year      = {2012},
  url       = {https://doi.org/10.1145/2151171.2151172},
  doi       = {10.1145/2151171.2151172},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AumannLMPY12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AwerbuchKR12,
  author    = {Baruch Awerbuch and
               Rohit Khandekar and
               Satish Rao},
  title     = {Distributed algorithms for multicommodity flow problems via approximate
               steepest descent framework},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {3:1--3:14},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390179},
  doi       = {10.1145/2390176.2390179},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AwerbuchKR12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaptisteCD12,
  author    = {Philippe Baptiste and
               Marek Chrobak and
               Christoph D{\"{u}}rr},
  title     = {Polynomial-time algorithms for minimum energy scheduling},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {26:1--26:29},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229170},
  doi       = {10.1145/2229163.2229170},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BaptisteCD12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BassinoCN12,
  author    = {Fr{\'{e}}d{\'{e}}rique Bassino and
               Julien Cl{\'{e}}ment and
               Pierre Nicod{\`{e}}me},
  title     = {Counting occurrences for a finite set of words: Combinatorial methods},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {31:1--31:28},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229175},
  doi       = {10.1145/2229163.2229175},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BassinoCN12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaswanaKS12,
  author    = {Surender Baswana and
               Sumeet Khurana and
               Soumojit Sarkar},
  title     = {Fully dynamic randomized algorithms for graph spanners},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {35:1--35:51},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344425},
  doi       = {10.1145/2344422.2344425},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BaswanaKS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BateniH12,
  author    = {MohammadHossein Bateni and
               MohammadTaghi Hajiaghayi},
  title     = {Assignment problem in content distribution networks: Unsplittable
               hard-capacitated facility location},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {20:1--20:19},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229164},
  doi       = {10.1145/2229163.2229164},
  timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BateniH12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Binkele-RaibleFFLSV12,
  author    = {Daniel Binkele{-}Raible and
               Henning Fernau and
               Fedor V. Fomin and
               Daniel Lokshtanov and
               Saket Saurabh and
               Yngve Villanger},
  title     = {Kernel(s) for problems with no kernel: On out-trees with many leaves},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {38:1--38:19},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344428},
  doi       = {10.1145/2344422.2344428},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Binkele-RaibleFFLSV12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BjorklundHKK12,
  author    = {Andreas Bj{\"{o}}rklund and
               Thore Husfeldt and
               Petteri Kaski and
               Mikko Koivisto},
  title     = {The traveling salesman problem in bounded degree graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {18:1--18:13},
  year      = {2012},
  url       = {https://doi.org/10.1145/2151171.2151181},
  doi       = {10.1145/2151171.2151181},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BjorklundHKK12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BockerBT12,
  author    = {Sebastian B{\"{o}}cker and
               Quang Bao Anh Bui and
               Anke Tru{\ss}},
  title     = {Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {1},
  pages     = {7:1--7:17},
  year      = {2012},
  url       = {https://doi.org/10.1145/2071379.2071386},
  doi       = {10.1145/2071379.2071386},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BockerBT12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BodlaenderFKKT12,
  author    = {Hans L. Bodlaender and
               Fedor V. Fomin and
               Arie M. C. A. Koster and
               Dieter Kratsch and
               Dimitrios M. Thilikos},
  title     = {On exact algorithms for treewidth},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {12:1--12:23},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390188},
  doi       = {10.1145/2390176.2390188},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BodlaenderFKKT12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BonifaciCMM12,
  author    = {Vincenzo Bonifaci and
               Ho{-}Leung Chan and
               Alberto Marchetti{-}Spaccamela and
               Nicole Megow},
  title     = {Algorithms and complexity for periodic real-time scheduling},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {6:1--6:19},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390182},
  doi       = {10.1145/2390176.2390182},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BonifaciCMM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BoseCHMM12,
  author    = {Prosenjit Bose and
               Eric Y. Chen and
               Meng He and
               Anil Maheshwari and
               Pat Morin},
  title     = {Succinct geometric indexes supporting point location queries},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {10:1--10:26},
  year      = {2012},
  url       = {https://doi.org/10.1145/2151171.2151173},
  doi       = {10.1145/2151171.2151173},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BoseCHMM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Chan12,
  author    = {Timothy M. Chan},
  title     = {All-pairs shortest paths for unweighted undirected graphs in \emph{o}(\emph{mn})
               time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {34:1--34:17},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344424},
  doi       = {10.1145/2344422.2344424},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Chan12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriCH12,
  author    = {Chandra Chekuri and
               Kenneth L. Clarkson and
               Sariel Har{-}Peled},
  title     = {On the set multicover problem in geometric settings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {9:1--9:17},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390185},
  doi       = {10.1145/2390176.2390185},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChekuriCH12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriKP12,
  author    = {Chandra Chekuri and
               Nitish Korula and
               Martin P{\'{a}}l},
  title     = {Improved algorithms for orienteering and related problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {23:1--23:27},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229167},
  doi       = {10.1145/2229163.2229167},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChekuriKP12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChenLLSZ12,
  author    = {Jianer Chen and
               Yang Liu and
               Songjian Lu and
               Sing{-}Hoi Sze and
               Fenghui Zhang},
  title     = {Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {1},
  pages     = {6:1--6:22},
  year      = {2012},
  url       = {https://doi.org/10.1145/2071379.2071385},
  doi       = {10.1145/2071379.2071385},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChenLLSZ12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChlebusKR12,
  author    = {Bogdan S. Chlebus and
               Dariusz R. Kowalski and
               Mariusz A. Rokicki},
  title     = {Adversarial Queuing on the Multiple Access Channel},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {1},
  pages     = {5:1--5:31},
  year      = {2012},
  url       = {https://doi.org/10.1145/2071379.2071384},
  doi       = {10.1145/2071379.2071384},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChlebusKR12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ColletteDILM12,
  author    = {S{\'{e}}bastien Collette and
               Vida Dujmovic and
               John Iacono and
               Stefan Langerman and
               Pat Morin},
  title     = {Entropy, triangulation, and point location in planar subdivisions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {29:1--29:18},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229173},
  doi       = {10.1145/2229163.2229173},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ColletteDILM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganP12,
  author    = {Marek Cygan and
               Marcin Pilipczuk},
  title     = {Even Faster Exact Bandwidth},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {1},
  pages     = {8:1--8:14},
  year      = {2012},
  url       = {https://doi.org/10.1145/2071379.2071387},
  doi       = {10.1145/2071379.2071387},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CyganP12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CzyzowiczPL12,
  author    = {Jurek Czyzowicz and
               Andrzej Pelc and
               Arnaud Labourel},
  title     = {How to meet asynchronously (almost) everywhere},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {37:1--37:14},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344427},
  doi       = {10.1145/2344422.2344427},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CzyzowiczPL12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DamerowMHRSST12,
  author    = {Valentina Damerow and
               Bodo Manthey and
               Friedhelm Meyer auf der Heide and
               Harald R{\"{a}}cke and
               Christian Scheideler and
               Christian Sohler and
               Till Tantau},
  title     = {Smoothed analysis of left-to-right maxima with applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {30:1--30:28},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229174},
  doi       = {10.1145/2229163.2229174},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DamerowMHRSST12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineHMZ12,
  author    = {Erik D. Demaine and
               Mohammad Taghi Hajiaghayi and
               Hamid Mahini and
               Morteza Zadimoghaddam},
  title     = {The price of anarchy in network creation games},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {13:1--13:13},
  year      = {2012},
  url       = {https://doi.org/10.1145/2151171.2151176},
  doi       = {10.1145/2151171.2151176},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DemaineHMZ12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DeshpandeH12,
  author    = {Amol Deshpande and
               Lisa Hellerstein},
  title     = {Parallel pipelined filter ordering with precedence constraints},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {41:1--41:38},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344431},
  doi       = {10.1145/2344422.2344431},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DeshpandeH12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DiedrichJPSS12,
  author    = {Florian Diedrich and
               Klaus Jansen and
               Lars Pr{\"{a}}del and
               Ulrich M. Schwarz and
               Ola Svensson},
  title     = {Tight approximation algorithms for scheduling with fixed jobs and
               nonavailability},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {27:1--27:15},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229171},
  doi       = {10.1145/2229163.2229171},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DiedrichJPSS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DrmotaK12,
  author    = {Michael Drmota and
               Reinhard Kutzelnigg},
  title     = {A precise analysis of Cuckoo hashing},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {11:1--11:36},
  year      = {2012},
  url       = {https://doi.org/10.1145/2151171.2151174},
  doi       = {10.1145/2151171.2151174},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DrmotaK12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EbrahimiF12,
  author    = {B. Javad Ebrahimi and
               Christina Fragouli},
  title     = {Combinatiorial algorithms for wireless information flow},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {8:1--8:33},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390184},
  doi       = {10.1145/2390176.2390184},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EbrahimiF12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EdmondsP12,
  author    = {Jeff Edmonds and
               Kirk Pruhs},
  title     = {Scalably scheduling processes with arbitrary speedup curves},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {28:1--28:10},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229172},
  doi       = {10.1145/2229163.2229172},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EdmondsP12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FanelliFM12,
  author    = {Angelo Fanelli and
               Michele Flammini and
               Luca Moscardelli},
  title     = {The speed of convergence in congestion games under best-response dynamics},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {25:1--25:15},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229169},
  doi       = {10.1145/2229163.2229169},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FanelliFM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FischerLMNY12,
  author    = {Eldar Fischer and
               Oded Lachish and
               Arie Matsliah and
               Ilan Newman and
               Orly Yahalom},
  title     = {On the query complexity of testing orientations for being Eulerian},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {15:1--15:41},
  year      = {2012},
  url       = {https://doi.org/10.1145/2151171.2151178},
  doi       = {10.1145/2151171.2151178},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FischerLMNY12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FrigoLPR12,
  author    = {Matteo Frigo and
               Charles E. Leiserson and
               Harald Prokop and
               Sridhar Ramachandran},
  title     = {Cache-Oblivious Algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {1},
  pages     = {4:1--4:22},
  year      = {2012},
  url       = {https://doi.org/10.1145/2071379.2071383},
  doi       = {10.1145/2071379.2071383},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FrigoLPR12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Fujito12,
  author    = {Toshihiro Fujito},
  title     = {How to trim a {MST:} {A} 2-Approximation algorithm for minimum cost-tree
               cover},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {16:1--16:11},
  year      = {2012},
  url       = {https://doi.org/10.1145/2151171.2151179},
  doi       = {10.1145/2151171.2151179},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Fujito12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GiesenJL12,
  author    = {Joachim Giesen and
               Martin Jaggi and
               S{\"{o}}ren Laue},
  title     = {Approximating parameterized convex optimization problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {10:1--10:17},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390186},
  doi       = {10.1145/2390176.2390186},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GiesenJL12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GuhaM12,
  author    = {Sudipto Guha and
               Kamesh Munagala},
  title     = {Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization
               Problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {1},
  pages     = {1:1--1:23},
  year      = {2012},
  url       = {https://doi.org/10.1145/2071379.2071380},
  doi       = {10.1145/2071379.2071380},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GuhaM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HaeuplerKMST12,
  author    = {Bernhard Haeupler and
               Telikepalli Kavitha and
               Rogers Mathew and
               Siddhartha Sen and
               Robert Endre Tarjan},
  title     = {Incremental Cycle Detection, Topological Ordering, and Strong Component
               Maintenance},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {1},
  pages     = {3:1--3:33},
  year      = {2012},
  url       = {https://doi.org/10.1145/2071379.2071382},
  doi       = {10.1145/2071379.2071382},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HaeuplerKMST12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HajiaghayiKKN12,
  author    = {Mohammad Taghi Hajiaghayi and
               Rohit Khandekar and
               Guy Kortsarz and
               Zeev Nutov},
  title     = {Prize-collecting steiner network problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {2:1--2:13},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390178},
  doi       = {10.1145/2390176.2390178},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HajiaghayiKKN12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Halldorsson12,
  author    = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title     = {Wireless scheduling with power control},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {7:1--7:20},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390183},
  doi       = {10.1145/2390176.2390183},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Halldorsson12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HeMS12,
  author    = {Meng He and
               J. Ian Munro and
               Srinivasa Rao Satti},
  title     = {Succinct ordinal trees based on tree covering},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {42:1--42:32},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344432},
  doi       = {10.1145/2344422.2344432},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HeMS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ImM12,
  author    = {Sungjin Im and
               Benjamin Moseley},
  title     = {An online scalable algorithm for average flow time in broadcast scheduling},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {39:1--39:17},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344429},
  doi       = {10.1145/2344422.2344429},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ImM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JezLSS12,
  author    = {Lukasz Jez and
               Fei Li and
               Jay Sethuraman and
               Clifford Stein},
  title     = {Online scheduling of packets with agreeable deadlines},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {5:1--5:11},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390181},
  doi       = {10.1145/2390176.2390181},
  timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/JezLSS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KarakostasKW12,
  author    = {George Karakostas and
               Stavros G. Kolliopoulos and
               Jing Wang},
  title     = {An {FPTAS} for the minimum total weighted tardiness problem with a
               fixed number of distinct due dates},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {40:1--40:16},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344430},
  doi       = {10.1145/2344422.2344430},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KarakostasKW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KrokhinM12,
  author    = {Andrei A. Krokhin and
               D{\'{a}}niel Marx},
  title     = {On the hardness of losing weight},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {19:1--19:18},
  year      = {2012},
  url       = {https://doi.org/10.1145/2151171.2151182},
  doi       = {10.1145/2151171.2151182},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/KrokhinM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MahdianNS12,
  author    = {Mohammad Mahdian and
               Hamid Nazerzadeh and
               Amin Saberi},
  title     = {Online Optimization with Uncertain Information},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {1},
  pages     = {2:1--2:29},
  year      = {2012},
  url       = {https://doi.org/10.1145/2071379.2071381},
  doi       = {10.1145/2071379.2071381},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MahdianNS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Manthey12,
  author    = {Bodo Manthey},
  title     = {On approximating multicriteria {TSP}},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {17:1--17:18},
  year      = {2012},
  url       = {https://doi.org/10.1145/2151171.2151180},
  doi       = {10.1145/2151171.2151180},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Manthey12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MeyerZ12,
  author    = {Ulrich Meyer and
               Norbert Zeh},
  title     = {I/O-efficient shortest path algorithms for undirected graphs with
               random or bounded edge lengths},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {22:1--22:28},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229166},
  doi       = {10.1145/2229163.2229166},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MeyerZ12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Nutov12,
  author    = {Zeev Nutov},
  title     = {Approximating minimum-cost connectivity problems via uncrossable bifamilies},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {1:1--1:16},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390177},
  doi       = {10.1145/2390176.2390177},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Nutov12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PanconesiR12,
  author    = {Alessandro Panconesi and
               Jaikumar Radhakrishnan},
  title     = {Expansion properties of (secure) wireless networks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {3},
  pages     = {21:1--21:9},
  year      = {2012},
  url       = {https://doi.org/10.1145/2229163.2229165},
  doi       = {10.1145/2229163.2229165},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/PanconesiR12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PhilipRS12,
  author    = {Geevarghese Philip and
               Venkatesh Raman and
               Somnath Sikdar},
  title     = {Polynomial kernels for dominating set in graphs of bounded degeneracy
               and beyond},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {9},
  number    = {1},
  pages     = {11:1--11:23},
  year      = {2012},
  url       = {https://doi.org/10.1145/2390176.2390187},
  doi       = {10.1145/2390176.2390187},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/PhilipRS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RodittyZ12,
  author    = {Liam Roditty and
               Uri Zwick},
  title     = {Replacement paths and \emph{k} simple shortest paths in unweighted
               directed graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {33:1--33:11},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344423},
  doi       = {10.1145/2344422.2344423},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RodittyZ12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Swamy12,
  author    = {Chaitanya Swamy},
  title     = {The effectiveness of stackelberg strategies and tolls for network
               congestion games},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {36:1--36:19},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344426},
  doi       = {10.1145/2344422.2344426},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Swamy12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/YeB12,
  author    = {Yuli Ye and
               Allan Borodin},
  title     = {Elimination graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {14:1--14:23},
  year      = {2012},
  url       = {https://doi.org/10.1145/2151171.2151177},
  doi       = {10.1145/2151171.2151177},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/YeB12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/YiZ12,
  author    = {Ke Yi and
               Qin Zhang},
  title     = {Multidimensional online tracking},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {2},
  pages     = {12:1--12:16},
  year      = {2012},
  url       = {https://doi.org/10.1145/2151171.2151175},
  doi       = {10.1145/2151171.2151175},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/YiZ12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AmbuhlGPRZ11,
  author    = {Christoph Amb{\"{u}}hl and
               Leszek Gasieniec and
               Andrzej Pelc and
               Tomasz Radzik and
               Xiaohui Zhang},
  title     = {Tree exploration with logarithmic memory},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {17:1--17:21},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921663},
  doi       = {10.1145/1921659.1921663},
  timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AmbuhlGPRZ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AumannLLT11,
  author    = {Yonatan Aumann and
               Moshe Lewenstein and
               Noa Lewenstein and
               Dekel Tsur},
  title     = {Finding witnesses by peeling},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {24:1--24:15},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921670},
  doi       = {10.1145/1921659.1921670},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AumannLLT11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BarbayHMS11,
  author    = {J{\'{e}}r{\'{e}}my Barbay and
               Meng He and
               J. Ian Munro and
               Srinivasa Rao Satti},
  title     = {Succinct indexes for strings, binary relations and multilabeled trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {52:1--52:27},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000820},
  doi       = {10.1145/2000807.2000820},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BarbayHMS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Ben-AroyaT11,
  author    = {Avraham Ben{-}Aroya and
               Sivan Toledo},
  title     = {Competitive analysis of flash memory algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {23:1--23:37},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921669},
  doi       = {10.1145/1921659.1921669},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Ben-AroyaT11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BilleG11,
  author    = {Philip Bille and
               Inge Li G{\o}rtz},
  title     = {The tree inclusion problem: In linear space and faster},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {38:1--38:47},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978793},
  doi       = {10.1145/1978782.1978793},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BilleG11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BonifaciKMS11,
  author    = {Vincenzo Bonifaci and
               Peter Korteweg and
               Alberto Marchetti{-}Spaccamela and
               Leen Stougie},
  title     = {Minimizing flow time in the wireless gathering problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {33:1--33:20},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978788},
  doi       = {10.1145/1978782.1978788},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BonifaciKMS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BonsmaD11,
  author    = {Paul S. Bonsma and
               Frederic Dorn},
  title     = {Tight bounds and a fast {FPT} algorithm for directed Max-Leaf Spanning
               Tree},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {44:1--44:19},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000812},
  doi       = {10.1145/2000807.2000812},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BonsmaD11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BorodinCM11,
  author    = {Allan Borodin and
               David Cashman and
               Avner Magen},
  title     = {How well can primal-dual and local-ratio algorithms perform?},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {29:1--29:26},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978784},
  doi       = {10.1145/1978782.1978784},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BorodinCM11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CabelloGKMR11,
  author    = {Sergio Cabello and
               Panos Giannopoulos and
               Christian Knauer and
               D{\'{a}}niel Marx and
               G{\"{u}}nter Rote},
  title     = {Geometric clustering: Fixed-parameter tractability and lower bounds
               with respect to the dimension},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {43:1--43:27},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000811},
  doi       = {10.1145/2000807.2000811},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CabelloGKMR11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CalinescuCKR11,
  author    = {Gruia C{\u{a}}linescu and
               Amit Chakrabarti and
               Howard J. Karloff and
               Yuval Rabani},
  title     = {An improved approximation algorithm for resource allocation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {48:1--48:7},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000816},
  doi       = {10.1145/2000807.2000816},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CalinescuCKR11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChakaravarthyPRAM11,
  author    = {Venkatesan T. Chakaravarthy and
               Vinayaka Pandit and
               Sambuddha Roy and
               Pranjal Awasthi and
               Mukesh K. Mohania},
  title     = {Decision trees for entity identification: Approximation algorithms
               and hardness results},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {15:1--15:22},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921661},
  doi       = {10.1145/1921659.1921661},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChakaravarthyPRAM11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChangEGK11,
  author    = {Jessica Chang and
               Thomas Erlebach and
               Renars Gailis and
               Samir Khuller},
  title     = {Broadcast scheduling: Algorithms and complexity},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {47:1--47:14},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000815},
  doi       = {10.1145/2000807.2000815},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChangEGK11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriEGS11,
  author    = {Chandra Chekuri and
               Guy Even and
               Anupam Gupta and
               Danny Segev},
  title     = {Set connectivity problems in undirected graphs and the directed steiner
               network problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {18:1--18:17},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921664},
  doi       = {10.1145/1921659.1921664},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChekuriEGS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChoiS11,
  author    = {Yongwook Choi and
               Wojciech Szpankowski},
  title     = {Constrained pattern matching},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {25:1--25:19},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921671},
  doi       = {10.1145/1921659.1921671},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChoiS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChungRV11,
  author    = {Kai{-}Min Chung and
               Omer Reingold and
               Salil P. Vadhan},
  title     = {{S-T} connectivity on digraphs with a known stationary distribution},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {30:1--30:21},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978785},
  doi       = {10.1145/1978782.1978785},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChungRV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CoppersmithNPTW11,
  author    = {Don Coppersmith and
               Tomasz Nowicki and
               Giuseppe Paleologo and
               Charles Philippe Tresser and
               Chai Wah Wu},
  title     = {The optimality of the online greedy algorithm in carpool and chairman
               assignment problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {37:1--37:22},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978792},
  doi       = {10.1145/1978782.1978792},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CoppersmithNPTW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CormodeMY11,
  author    = {Graham Cormode and
               S. Muthukrishnan and
               Ke Yi},
  title     = {Algorithms for distributed functional monitoring},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {21:1--21:20},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921667},
  doi       = {10.1145/1921659.1921667},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CormodeMY11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DvorakKT11,
  author    = {Zdenek Dvor{\'{a}}k and
               Ken{-}ichi Kawarabayashi and
               Robin Thomas},
  title     = {Three-coloring triangle-free planar graphs in linear time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {41:1--41:14},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000809},
  doi       = {10.1145/2000807.2000809},
  timestamp = {Thu, 12 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/DvorakKT11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EdmondsP11,
  author    = {Jeff Edmonds and
               Kirk Pruhs},
  title     = {Cake cutting really is not a piece of cake},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {51:1--51:12},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000819},
  doi       = {10.1145/2000807.2000819},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EdmondsP11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Elkin11,
  author    = {Michael Elkin},
  title     = {Streaming and fully dynamic centralized algorithms for constructing
               and maintaining sparse spanners},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {20:1--20:17},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921666},
  doi       = {10.1145/1921659.1921666},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Elkin11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Fotakis11,
  author    = {Dimitris Fotakis},
  title     = {Memoryless facility location in one pass},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {49:1--49:24},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000817},
  doi       = {10.1145/2000807.2000817},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Fotakis11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FriggstadS11,
  author    = {Zachary Friggstad and
               Mohammad R. Salavatipour},
  title     = {Minimizing movement in mobile facility location problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {28:1--28:22},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978783},
  doi       = {10.1145/1978782.1978783},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FriggstadS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FuKW11,
  author    = {Bin Fu and
               Ming{-}Yang Kao and
               Lusheng Wang},
  title     = {Discovering almost any hidden motif from multiple sequences},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {26:1--26:18},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921672},
  doi       = {10.1145/1921659.1921672},
  timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FuKW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GairingMT11,
  author    = {Martin Gairing and
               Burkhard Monien and
               Karsten Tiemann},
  title     = {Routing (un-) splittable flow in games with player-specific affine
               latency functions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {31:1--31:31},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978786},
  doi       = {10.1145/1978782.1978786},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GairingMT11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GeorgiadisKSTW11,
  author    = {Loukas Georgiadis and
               Haim Kaplan and
               Nira Shafrir and
               Robert Endre Tarjan and
               Renato Fonseca F. Werneck},
  title     = {Data structures for mergeable trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {14:1--14:30},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921660},
  doi       = {10.1145/1921659.1921660},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GeorgiadisKSTW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HalldorssonKS11,
  author    = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Guy Kortsarz and
               Maxim Sviridenko},
  title     = {Sum edge coloring of multigraphs via configuration {LP}},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {22:1--22:21},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921668},
  doi       = {10.1145/1921659.1921668},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HalldorssonKS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HanCTZZ11,
  author    = {Xin Han and
               Francis Y. L. Chin and
               Hing{-}Fung Ting and
               Guochuan Zhang and
               Yong Zhang},
  title     = {A new upper bound 2.5545 on 2D Online Bin Packing},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {50:1--50:18},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000818},
  doi       = {10.1145/2000807.2000818},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HanCTZZ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/IzsakP11,
  author    = {Alexander Izsak and
               Nicholas Pippenger},
  title     = {Carry propagation in multiplication by constants},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {54:1--54:11},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000822},
  doi       = {10.1145/2000807.2000822},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/IzsakP11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Jacobs11,
  author    = {Tobias Jacobs},
  title     = {Constant factor approximations for the hotlink assignment problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {16:1--16:19},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921662},
  doi       = {10.1145/1921659.1921662},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Jacobs11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KhullerMM11,
  author    = {Samir Khuller and
               Azarakhsh Malekian and
               Juli{\'{a}}n Mestre},
  title     = {To fill or not to fill: The gas station problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {36:1--36:16},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978791},
  doi       = {10.1145/1978782.1978791},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KhullerMM11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KranakisKM11,
  author    = {Evangelos Kranakis and
               Danny Krizanc and
               Pat Morin},
  title     = {Randomized rendezvous with limited memory},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {34:1--34:12},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978789},
  doi       = {10.1145/1978782.1978789},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KranakisKM11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LaberM11,
  author    = {Eduardo Sany Laber and
               Marco Molinaro},
  title     = {Improved approximations for the hotlink assignment problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {39:1--39:34},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978794},
  doi       = {10.1145/1978782.1978794},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LaberM11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MoranSS11,
  author    = {Shlomo Moran and
               Sagi Snir and
               Wing{-}Kin Sung},
  title     = {Partial convex recolorings of trees and galled networks: Tight upper
               and lower bounds},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {42:1--42:20},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000810},
  doi       = {10.1145/2000807.2000810},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MoranSS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NongZC11,
  author    = {Ge Nong and
               Sen Zhang and
               Wai Hong Chan},
  title     = {Computing the inverse sort transform in linear time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {27:1--27:16},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921673},
  doi       = {10.1145/1921659.1921673},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/NongZC11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PemmarajuRV11,
  author    = {Sriram V. Pemmaraju and
               Rajiv Raman and
               Kasturi R. Varadarajan},
  title     = {Max-coloring and online coloring with bandwidths on interval graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {35:1--35:21},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978790},
  doi       = {10.1145/1978782.1978790},
  timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/PemmarajuRV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PritchardT11,
  author    = {David Pritchard and
               Ramakrishna Thurimella},
  title     = {Fast computation of small cuts via cycle space sampling},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {46:1--46:30},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000814},
  doi       = {10.1145/2000807.2000814},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/PritchardT11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RodittyS11,
  author    = {Liam Roditty and
               Asaf Shapira},
  title     = {All-pairs shortest paths with a sublinear additive error},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {45:1--45:12},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000813},
  doi       = {10.1145/2000807.2000813},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RodittyS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RosenS11,
  author    = {Adi Ros{\'{e}}n and
               Gabriel Scalosub},
  title     = {Rate vs. buffer size-greedy information gathering on the line},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {3},
  pages     = {32:1--32:22},
  year      = {2011},
  url       = {https://doi.org/10.1145/1978782.1978787},
  doi       = {10.1145/1978782.1978787},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RosenS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RussoNO11,
  author    = {Lu{\'{\i}}s M. S. Russo and
               Gonzalo Navarro and
               Arlindo L. Oliveira},
  title     = {Fully compressed suffix trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {53:1--53:34},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000821},
  doi       = {10.1145/2000807.2000821},
  timestamp = {Sat, 24 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RussoNO11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SalvySSSV11,
  author    = {Bruno Salvy and
               Bob Sedgewick and
               Mich{\`{e}}le Soria and
               Wojciech Szpankowski and
               Brigitte Vall{\'{e}}e},
  title     = {Philippe flajolet, the father of analytic combinatorics},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {4},
  pages     = {40:1--40:2},
  year      = {2011},
  url       = {https://doi.org/10.1145/2000807.2000808},
  doi       = {10.1145/2000807.2000808},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/SalvySSSV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/VerdiereS11,
  author    = {{\'{E}}ric Colin de Verdi{\`{e}}re and
               Alexander Schrijver},
  title     = {Shortest vertex-disjoint two-face paths in planar graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {2},
  pages     = {19:1--19:12},
  year      = {2011},
  url       = {https://doi.org/10.1145/1921659.1921665},
  doi       = {10.1145/1921659.1921665},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/VerdiereS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AckermannBS10,
  author    = {Marcel R. Ackermann and
               Johannes Bl{\"{o}}mer and
               Christian Sohler},
  title     = {Clustering for metric and nonmetric distance measures},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {59:1--59:26},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824779},
  doi       = {10.1145/1824777.1824779},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AckermannBS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AgarwalAY10,
  author    = {Pankaj K. Agarwal and
               Lars Arge and
               Ke Yi},
  title     = {I/O-efficient batched union-find and its applications to terrain analysis},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {11:1--11:21},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868249},
  doi       = {10.1145/1868237.1868249},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AgarwalAY10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AgarwalHSW10,
  author    = {Pankaj K. Agarwal and
               Sariel Har{-}Peled and
               Micha Sharir and
               Yusu Wang},
  title     = {Hausdorff distance under translation for points and balls},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {71:1--71:26},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824791},
  doi       = {10.1145/1824777.1824791},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AgarwalHSW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AggarwalPFTKKZ10,
  author    = {Gagan Aggarwal and
               Rina Panigrahy and
               Tom{\'{a}}s Feder and
               Dilys Thomas and
               Krishnaram Kenthapadi and
               Samir Khuller and
               An Zhu},
  title     = {Achieving anonymity via clustering},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {49:1--49:19},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798602},
  doi       = {10.1145/1798596.1798602},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AggarwalPFTKKZ10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Albers10,
  author    = {Susanne Albers},
  title     = {Editorial Note},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {22:1},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721838},
  doi       = {10.1145/1721837.1721838},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Albers10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Albers10a,
  author    = {Susanne Albers},
  title     = {Editorial note},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {57:1},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824778},
  doi       = {10.1145/1824777.1824778},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Albers10a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlonG10,
  author    = {Noga Alon and
               Shai Gutner},
  title     = {Balanced families of perfect hash functions and their applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {54:1--54:12},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798607},
  doi       = {10.1145/1798596.1798607},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlonG10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AminofKL10,
  author    = {Benjamin Aminof and
               Orna Kupferman and
               Robby Lampert},
  title     = {Reasoning about online algorithms with weighted automata},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {28:1--28:36},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721844},
  doi       = {10.1145/1721837.1721844},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AminofKL10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Andersen10,
  author    = {Reid Andersen},
  title     = {A local algorithm for finding dense subgraphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {60:1--60:12},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824780},
  doi       = {10.1145/1824777.1824780},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Andersen10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AspnesC10,
  author    = {James Aspnes and
               Keren Censor},
  title     = {Approximate shared-memory counting despite a strong adversary},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {25:1--25:23},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721841},
  doi       = {10.1145/1721837.1721841},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AspnesC10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AzarGG10,
  author    = {Yossi Azar and
               Iftah Gamzu and
               Shai Gutner},
  title     = {Truthful unsplittable flow for large capacity networks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {36:1--36:20},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721852},
  doi       = {10.1145/1721837.1721852},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AzarGG10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AzarKP10,
  author    = {Yossi Azar and
               Shay Kutten and
               Boaz Patt{-}Shamir},
  title     = {Distributed error confinement},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {48:1--48:23},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798601},
  doi       = {10.1145/1798596.1798601},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AzarKP10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaierEHKKPSS10,
  author    = {Georg Baier and
               Thomas Erlebach and
               Alexander Hall and
               Ekkehard K{\"{o}}hler and
               Petr Kolman and
               Ondrej Pangr{\'{a}}c and
               Heiko Schilling and
               Martin Skutella},
  title     = {Length-bounded cuts and flows},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {4:1--4:27},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868241},
  doi       = {10.1145/1868237.1868241},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BaierEHKKPSS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BansalCCRSS10,
  author    = {Nikhil Bansal and
               Ning Chen and
               Neva Cherniavsky and
               Atri Rudra and
               Baruch Schieber and
               Maxim Sviridenko},
  title     = {Dynamic pricing for impatient bidders},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {35:1--35:21},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721851},
  doi       = {10.1145/1721837.1721851},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BansalCCRSS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaswanaKMP10,
  author    = {Surender Baswana and
               Telikepalli Kavitha and
               Kurt Mehlhorn and
               Seth Pettie},
  title     = {Additive spanners and (alpha, beta)-spanners},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {5:1--5:26},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868242},
  doi       = {10.1145/1868237.1868242},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BaswanaKMP10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BobierS10,
  author    = {Bruce A. Bobier and
               Joe Sawada},
  title     = {A fast algorithm to generate open meandric systems and meanders},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {42:1--42:12},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721858},
  doi       = {10.1145/1721837.1721858},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BobierS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ButmanHLR10,
  author    = {Ayelet Butman and
               Danny Hermelin and
               Moshe Lewenstein and
               Dror Rawitz},
  title     = {Optimization problems in multiple-interval graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {40:1--40:18},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721856},
  doi       = {10.1145/1721837.1721856},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ButmanHLR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Cabello10,
  author    = {Sergio Cabello},
  title     = {Finding shortest contractible and shortest separating cycles in embedded
               graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {24:1--24:18},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721840},
  doi       = {10.1145/1721837.1721840},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Cabello10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CabelloDEM10,
  author    = {Sergio Cabello and
               Matt DeVos and
               Jeff Erickson and
               Bojan Mohar},
  title     = {Finding one tight cycle},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {61:1--61:13},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824781},
  doi       = {10.1145/1824777.1824781},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CabelloDEM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CaragiannisKK10,
  author    = {Ioannis Caragiannis and
               Christos Kaklamanis and
               Panagiotis Kanellopoulos},
  title     = {Taxes for linear atomic congestion games},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {13:1--13:31},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868251},
  doi       = {10.1145/1868237.1868251},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CaragiannisKK10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CarlssonAY10,
  author    = {John Gunnar Carlsson and
               Benjamin Armbruster and
               Yinyu Ye},
  title     = {Finding equitable convex partitions of points in a polygon efficiently},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {72:1--72:19},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824792},
  doi       = {10.1145/1824777.1824792},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CarlssonAY10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChakrabartiCM10,
  author    = {Amit Chakrabarti and
               Graham Cormode and
               Andrew McGregor},
  title     = {A near-optimal algorithm for estimating the entropy of a stream},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {51:1--51:21},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798604},
  doi       = {10.1145/1798596.1798604},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChakrabartiCM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Chan10,
  author    = {Timothy M. Chan},
  title     = {Comparison-based time-space lower bounds for selection},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {26:1--26:16},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721842},
  doi       = {10.1145/1721837.1721842},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Chan10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Chan10a,
  author    = {Timothy M. Chan},
  title     = {On the bichromatic \emph{k}-set problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {62:1--62:20},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824782},
  doi       = {10.1145/1824777.1824782},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Chan10a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChristodoulouKK10,
  author    = {George Christodoulou and
               Elias Koutsoupias and
               Annam{\'{a}}ria Kov{\'{a}}cs},
  title     = {Mechanism design for fractional scheduling on unrelated machines},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {38:1--38:18},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721854},
  doi       = {10.1145/1721837.1721854},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChristodoulouKK10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Clarkson10,
  author    = {Kenneth L. Clarkson},
  title     = {Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {63:1--63:30},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824783},
  doi       = {10.1145/1824777.1824783},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Clarkson10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CookW10,
  author    = {Atlas F. Cook and
               Carola Wenk},
  title     = {Geodesic Fr{\'{e}}chet distance inside a simple polygon},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {9:1--9:19},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868247},
  doi       = {10.1145/1868237.1868247},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CookW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CoppersmithFR10,
  author    = {Don Coppersmith and
               Lisa Fleischer and
               Atri Rudra},
  title     = {Ordering by weighted number of wins gives a good ranking for weighted
               tournaments},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {55:1--55:13},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798608},
  doi       = {10.1145/1798596.1798608},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CoppersmithFR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Djidjev10,
  author    = {Hristo Djidjev},
  title     = {A faster algorithm for computing the girth of planar and bounded genus
               graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {3:1--3:16},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868240},
  doi       = {10.1145/1868237.1868240},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Djidjev10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DrescherV10,
  author    = {Matthew Drescher and
               Adrian Vetta},
  title     = {An approximation algorithm for the maximum leaf spanning arborescence
               problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {46:1--46:18},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798599},
  doi       = {10.1145/1798596.1798599},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DrescherV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EmekPR10,
  author    = {Yuval Emek and
               David Peleg and
               Liam Roditty},
  title     = {A near-linear-time algorithm for computing replacement paths in planar
               directed graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {64:1--64:13},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824784},
  doi       = {10.1145/1824777.1824784},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EmekPR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EpsteinS10,
  author    = {Leah Epstein and
               Rob van Stee},
  title     = {On the online unit clustering problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {7:1--7:18},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868245},
  doi       = {10.1145/1868237.1868245},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/EpsteinS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ErgunMS10,
  author    = {Funda Erg{\"{u}}n and
               S. Muthukrishnan and
               S{\"{u}}leyman Cenk Sahinalp},
  title     = {Periodicity testing with sublinear samples and space},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {43:1--43:14},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721859},
  doi       = {10.1145/1721837.1721859},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ErgunMS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FaigleP10,
  author    = {Ulrich Faigle and
               Britta Peis},
  title     = {Two-phase greedy algorithms for some classes of combinatorial linear
               programs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {65:1--65:13},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824785},
  doi       = {10.1145/1824777.1824785},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FaigleP10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FattalR10,
  author    = {Shahar Fattal and
               Dana Ron},
  title     = {Approximating the distance to monotonicity in high dimensions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {52:1--52:37},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798605},
  doi       = {10.1145/1798596.1798605},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FattalR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FeldmanMSSS10,
  author    = {Jon Feldman and
               S. Muthukrishnan and
               Anastasios Sidiropoulos and
               Clifford Stein and
               Zoya Svitkina},
  title     = {On distributing symmetric streaming computations},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {66:1--66:19},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824786},
  doi       = {10.1145/1824777.1824786},
  timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FeldmanMSSS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FerraginaV10,
  author    = {Paolo Ferragina and
               Rossano Venturini},
  title     = {The compressed permuterm index},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {10:1--10:21},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868248},
  doi       = {10.1145/1868237.1868248},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FerraginaV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FlamminiN10,
  author    = {Michele Flammini and
               Gaia Nicosia},
  title     = {On the bicriteria \emph{k}-server problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {6:1--6:19},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868244},
  doi       = {10.1145/1868237.1868244},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FlamminiN10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GaoLS10,
  author    = {Jie Gao and
               Michael Langberg and
               Leonard J. Schulman},
  title     = {Clustering lines in high-dimensional space: Classification of incomplete
               data},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {8:1--8:26},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868246},
  doi       = {10.1145/1868237.1868246},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GaoLS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GoelGM10,
  author    = {Ashish Goel and
               Sudipto Guha and
               Kamesh Munagala},
  title     = {How to probe for an extreme value},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {12:1--12:20},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868250},
  doi       = {10.1145/1868237.1868250},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GoelGM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GoelKK10,
  author    = {Ashish Goel and
               Michael Kapralov and
               Sanjeev Khanna},
  title     = {Perfect matchings via uniform sampling in regular bipartite graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {27:1--27:13},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721843},
  doi       = {10.1145/1721837.1721843},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GoelKK10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Gonzalez-GutierrezG10,
  author    = {Arturo Gonzalez{-}Gutierrez and
               Teofilo F. Gonzalez},
  title     = {Approximating corridors and tours via restriction and relaxation techniques},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {56:1--56:36},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798609},
  doi       = {10.1145/1798596.1798609},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Gonzalez-GutierrezG10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GordonR10,
  author    = {Eyal Gordon and
               Adi Ros{\'{e}}n},
  title     = {Competitive weighted throughput analysis of greedy protocols on DAGs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {50:1--50:22},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798603},
  doi       = {10.1145/1798596.1798603},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GordonR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GuptaHNR10,
  author    = {Anupam Gupta and
               Mohammad Taghi Hajiaghayi and
               Viswanath Nagarajan and
               R. Ravi},
  title     = {Dial a Ride from \emph{k}-forest},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {41:1--41:21},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721857},
  doi       = {10.1145/1721837.1721857},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GuptaHNR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HajiaghayiT10,
  author    = {Mohammad Taghi Hajiaghayi and
               Shang{-}Hua Teng},
  title     = {Foreword to special issue on {SODA} 2008},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {58:1},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824793},
  doi       = {10.1145/1824777.1824793},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HajiaghayiT10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/IwamaMY10,
  author    = {Kazuo Iwama and
               Shuichi Miyazaki and
               Hiroki Yanagisawa},
  title     = {Approximation algorithms for the sex-equal stable marriage problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {2:1--2:17},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868239},
  doi       = {10.1145/1868237.1868239},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/IwamaMY10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KapronKKSS10,
  author    = {Bruce M. Kapron and
               David Kempe and
               Valerie King and
               Jared Saia and
               Vishal Sanwalani},
  title     = {Fast asynchronous Byzantine agreement and leader election with full
               information},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {68:1--68:28},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824788},
  doi       = {10.1145/1824777.1824788},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KapronKKSS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KleinMW10,
  author    = {Philip N. Klein and
               Shay Mozes and
               Oren Weimann},
  title     = {Shortest paths in directed planar graphs with negative lengths: {A}
               linear-space \emph{O}(\emph{n} log\({}^{\mbox{2}}\) \emph{n})-time
               algorithm},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {30:1--30:18},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721846},
  doi       = {10.1145/1721837.1721846},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/KleinMW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Korman10,
  author    = {Amos Korman},
  title     = {Labeling schemes for vertex connectivity},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {39:1--39:10},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721855},
  doi       = {10.1145/1721837.1721855},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Korman10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MadaniTZ10,
  author    = {Omid Madani and
               Mikkel Thorup and
               Uri Zwick},
  title     = {Discounted deterministic Markov decision processes and discounted
               all-pairs shortest paths},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {33:1--33:25},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721849},
  doi       = {10.1145/1721837.1721849},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MadaniTZ10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MartinezPV10,
  author    = {Conrado Mart{\'{\i}}nez and
               Daniel Panario and
               Alfredo Viola},
  title     = {Adaptive sampling strategies for quickselects},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {53:1--53:45},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798606},
  doi       = {10.1145/1798596.1798606},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/MartinezPV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Marx10,
  author    = {D{\'{a}}niel Marx},
  title     = {Approximating fractional hypertree width},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {29:1--29:17},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721845},
  doi       = {10.1145/1721837.1721845},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Marx10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Mathieu10,
  author    = {Claire Mathieu},
  title     = {Foreword to special issue {SODA} 2009},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {23:1},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721839},
  doi       = {10.1145/1721837.1721839},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Mathieu10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NaorS10,
  author    = {Joseph Naor and
               Roy Schwartz},
  title     = {The directed circular arrangement problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {47:1--47:22},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798600},
  doi       = {10.1145/1798596.1798600},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/NaorS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/OudotGGW10,
  author    = {Steve Oudot and
               Leonidas J. Guibas and
               Jie Gao and
               Yue Wang},
  title     = {Geodesic delaunay triangulations in bounded planar domains},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {67:1--67:47},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824787},
  doi       = {10.1145/1824777.1824787},
  timestamp = {Fri, 30 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/OudotGGW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PanagiotouS10,
  author    = {Konstantinos Panagiotou and
               Angelika Steger},
  title     = {Maximal biconnected subgraphs of random planar graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {31:1--31:21},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721847},
  doi       = {10.1145/1721837.1721847},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/PanagiotouS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RuskeyW10,
  author    = {Frank Ruskey and
               Aaron Williams},
  title     = {An explicit universal cycle for the (\emph{n}-1)-permutations of an
               \emph{n}-set},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {45:1--45:12},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798598},
  doi       = {10.1145/1798596.1798598},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/RuskeyW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RutterW10,
  author    = {Ignaz Rutter and
               Alexander Wolff},
  title     = {Computing large matchings fast},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {7},
  number    = {1},
  pages     = {1:1--1:21},
  year      = {2010},
  url       = {https://doi.org/10.1145/1868237.1868238},
  doi       = {10.1145/1868237.1868238},
  timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/RutterW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ShalitaZ10,
  author    = {Alon Shalita and
               Uri Zwick},
  title     = {Efficient algorithms for the 2-gathering problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {34:1--34:20},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721850},
  doi       = {10.1145/1721837.1721850},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ShalitaZ10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Svitkina10,
  author    = {Zoya Svitkina},
  title     = {Lower-bounded facility location},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {69:1--69:16},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824789},
  doi       = {10.1145/1824777.1824789},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Svitkina10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SvitkinaT10,
  author    = {Zoya Svitkina and
               {\'{E}}va Tardos},
  title     = {Facility location with hierarchical facility costs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {37:1--37:22},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721853},
  doi       = {10.1145/1721837.1721853},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/SvitkinaT10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Thomasse10,
  author    = {St{\'{e}}phan Thomass{\'{e}}},
  title     = {A 4\emph{k}\({}^{\mbox{2}}\) kernel for feedback vertex set},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {32:1--32:8},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721848},
  doi       = {10.1145/1721837.1721848},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Thomasse10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/VassilevskaWY10,
  author    = {Virginia Vassilevska and
               Ryan Williams and
               Raphael Yuster},
  title     = {Finding heaviest \emph{H}-subgraphs in real weighted graphs, with
               applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {44:1--44:23},
  year      = {2010},
  url       = {https://doi.org/10.1145/1798596.1798597},
  doi       = {10.1145/1798596.1798597},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/VassilevskaWY10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Williams10,
  author    = {Virginia Vassilevska Williams},
  title     = {Nondecreasing paths in a weighted graph or: How to optimally read
               a train schedule},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {4},
  pages     = {70:1--70:24},
  year      = {2010},
  url       = {https://doi.org/10.1145/1824777.1824790},
  doi       = {10.1145/1824777.1824790},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Williams10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlagicMR09,
  author    = {Gorjan Alagic and
               Cristopher Moore and
               Alexander Russell},
  title     = {Quantum algorithms for Simon's problem over nonabelian groups},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {19:1--19:15},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644034},
  doi       = {10.1145/1644015.1644034},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlagicMR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlonAG09,
  author    = {Noga Alon and
               Yossi Azar and
               Shai Gutner},
  title     = {Admission control to minimize rejections and online set cover with
               repetitions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {11:1--11:13},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644026},
  doi       = {10.1145/1644015.1644026},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlonAG09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlonsoR09,
  author    = {Laurent Alonso and
               Edward M. Reingold},
  title     = {Average-case analysis of some plurality algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {2},
  pages     = {17:1--17:36},
  year      = {2009},
  url       = {https://doi.org/10.1145/1497290.1497293},
  doi       = {10.1145/1497290.1497293},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlonsoR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AndreevGGMM09,
  author    = {Konstantin Andreev and
               Charles Garrod and
               Daniel Golovin and
               Bruce M. Maggs and
               Adam Meyerson},
  title     = {Simultaneous source location},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {16:1--16:17},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644031},
  doi       = {10.1145/1644015.1644031},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AndreevGGMM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Andrews09,
  author    = {Matthew Andrews},
  title     = {Instability of {FIFO} in the permanent sessions model at arbitrarily
               small network loads},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {3},
  pages     = {33:1--33:29},
  year      = {2009},
  url       = {https://doi.org/10.1145/1541885.1541894},
  doi       = {10.1145/1541885.1541894},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Andrews09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BabaiF09,
  author    = {L{\'{a}}szl{\'{o}} Babai and
               Pedro F. Felzenszwalb},
  title     = {Computing rank-convolutions with a mask},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {20:1--20:13},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644035},
  doi       = {10.1145/1644015.1644035},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BabaiF09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Bar-NoyGKNSS09,
  author    = {Amotz Bar{-}Noy and
               Sudipto Guha and
               Yoav Katz and
               Joseph Naor and
               Baruch Schieber and
               Hadas Shachnai},
  title     = {Throughput maximization of real-time scheduling with batching},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {2},
  pages     = {18:1--18:17},
  year      = {2009},
  url       = {https://doi.org/10.1145/1497290.1497294},
  doi       = {10.1145/1497290.1497294},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Bar-NoyGKNSS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BecchettiMVKSS09,
  author    = {Luca Becchetti and
               Alberto Marchetti{-}Spaccamela and
               Andrea Vitaletti and
               Peter Korteweg and
               Martin Skutella and
               Leen Stougie},
  title     = {Latency-constrained aggregation in sensor networks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {13:1--13:20},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644028},
  doi       = {10.1145/1644015.1644028},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BecchettiMVKSS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BeinGLZ09,
  author    = {Wolfgang W. Bein and
               Mordecai J. Golin and
               Lawrence L. Larmore and
               Yan Zhang},
  title     = {The Knuth-Yao quadrangle-inequality speedup is a consequence of total
               monotonicity},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {17:1--17:22},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644032},
  doi       = {10.1145/1644015.1644032},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BeinGLZ09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BerendB09,
  author    = {Daniel Berend and
               Vladimir Braverman},
  title     = {A linear algorithm for computing convex hulls for random lines},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {42:1--42:21},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597046},
  doi       = {10.1145/1597036.1597046},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BerendB09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BerryPGN09,
  author    = {Vincent Berry and
               Christophe Paul and
               Sylvain Guillemot and
               Fran{\c{c}}ois Nicolas},
  title     = {Linear time 3-approximation for the {MAST} problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {2},
  pages     = {23:1--23:18},
  year      = {2009},
  url       = {https://doi.org/10.1145/1497290.1497299},
  doi       = {10.1145/1497290.1497299},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BerryPGN09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BilleFG09,
  author    = {Philip Bille and
               Rolf Fagerberg and
               Inge Li G{\o}rtz},
  title     = {Improved approximate string matching and regular expression matching
               on Ziv-Lempel compressed texts},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {3:1--3:14},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644018},
  doi       = {10.1145/1644015.1644018},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BilleFG09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BorradaileKM09,
  author    = {Glencora Borradaile and
               Philip N. Klein and
               Claire Mathieu},
  title     = {An \emph{O}(\emph{n} log \emph{n}) approximation scheme for Steiner
               tree in planar graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {3},
  pages     = {31:1--31:31},
  year      = {2009},
  url       = {https://doi.org/10.1145/1541885.1541892},
  doi       = {10.1145/1541885.1541892},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BorradaileKM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BrussLW09,
  author    = {F. Thomas Bruss and
               Guy Louchard and
               Mark Daniel Ward},
  title     = {Inverse auctions: Injecting unique minima into random sets},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {21:1--21:19},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644036},
  doi       = {10.1145/1644015.1644036},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BrussLW09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CarrKLNP09,
  author    = {Robert D. Carr and
               Goran Konjevod and
               Greg Little and
               Venkatesh Natarajan and
               Ojas Parekh},
  title     = {Compacting cuts: {A} new linear formulation for minimum cut},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {3},
  pages     = {27:1--27:16},
  year      = {2009},
  url       = {https://doi.org/10.1145/1541885.1541888},
  doi       = {10.1145/1541885.1541888},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CarrKLNP09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChanCLLMW09,
  author    = {Ho{-}Leung Chan and
               Joseph Wun{-}Tat Chan and
               Tak Wah Lam and
               Lap{-}Kei Lee and
               Kin{-}Sum Mak and
               Prudence W. H. Wong},
  title     = {Optimizing throughput and energy in online deadline scheduling},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {10:1--10:22},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644025},
  doi       = {10.1145/1644015.1644025},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ChanCLLMW09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CharikarMM09,
  author    = {Moses Charikar and
               Konstantin Makarychev and
               Yury Makarychev},
  title     = {Near-optimal algorithms for maximum constraint satisfaction problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {3},
  pages     = {32:1--32:14},
  year      = {2009},
  url       = {https://doi.org/10.1145/1541885.1541893},
  doi       = {10.1145/1541885.1541893},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CharikarMM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChenKS09,
  author    = {Ke Chen and
               Haim Kaplan and
               Micha Sharir},
  title     = {Online conflict-free coloring for halfplanes, congruent disks, and
               axis-parallel rectangles},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {2},
  pages     = {16:1--16:24},
  year      = {2009},
  url       = {https://doi.org/10.1145/1497290.1497292},
  doi       = {10.1145/1497290.1497292},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChenKS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CohenRR09,
  author    = {Rami Cohen and
               Dror Rawitz and
               Danny Raz},
  title     = {Time-dependent multi-scheduling of multicast},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {14:1--14:22},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644029},
  doi       = {10.1145/1644015.1644029},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CohenRR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CondonDHW09,
  author    = {Anne Condon and
               Amol Deshpande and
               Lisa Hellerstein and
               Ning Wu},
  title     = {Algorithms for distributional and adversarial pipelined filter ordering
               problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {2},
  pages     = {24:1--24:34},
  year      = {2009},
  url       = {https://doi.org/10.1145/1497290.1497300},
  doi       = {10.1145/1497290.1497300},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CondonDHW09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineHMSGZ09,
  author    = {Erik D. Demaine and
               Mohammad Taghi Hajiaghayi and
               Hamid Mahini and
               Amin S. Sayedi{-}Roshkhar and
               Shayan Oveis Gharan and
               Morteza Zadimoghaddam},
  title     = {Minimizing movement},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {3},
  pages     = {30:1--30:30},
  year      = {2009},
  url       = {https://doi.org/10.1145/1541885.1541891},
  doi       = {10.1145/1541885.1541891},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DemaineHMSGZ09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineMRW09,
  author    = {Erik D. Demaine and
               Shay Mozes and
               Benjamin Rossman and
               Oren Weimann},
  title     = {An optimal decomposition algorithm for tree edit distance},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {2:1--2:19},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644017},
  doi       = {10.1145/1644015.1644017},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/DemaineMRW09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemetrescuFR09,
  author    = {Camil Demetrescu and
               Irene Finocchi and
               Andrea Ribichini},
  title     = {Trading off space for passes in graph streaming problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {6:1--6:17},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644021},
  doi       = {10.1145/1644015.1644021},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DemetrescuFR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DuchM09,
  author    = {Amalia Duch and
               Conrado Mart{\'{\i}}nez},
  title     = {Updating relaxed \emph{K}-d trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {4:1--4:24},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644019},
  doi       = {10.1145/1644015.1644019},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/DuchM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein09,
  author    = {David Eppstein},
  title     = {Testing bipartiteness of geometric intersection graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {2},
  pages     = {15:1--15:35},
  year      = {2009},
  url       = {https://doi.org/10.1145/1497290.1497291},
  doi       = {10.1145/1497290.1497291},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Eppstein09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein09a,
  author    = {David Eppstein},
  title     = {Squarepants in a tree: Sum of subtree clustering and hyperbolic pants
               decomposition},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {3},
  pages     = {29:1--29:24},
  year      = {2009},
  url       = {https://doi.org/10.1145/1541885.1541890},
  doi       = {10.1145/1541885.1541890},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Eppstein09a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein09b,
  author    = {David Eppstein},
  title     = {All maximal independent sets and dynamic dominance for sparse graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {38:1--38:14},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597042},
  doi       = {10.1145/1597036.1597042},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Eppstein09b.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EvenFKN09,
  author    = {Guy Even and
               Jon Feldman and
               Guy Kortsarz and
               Zeev Nutov},
  title     = {A 1.8 approximation algorithm for augmenting edge-connectivity of
               a graph from 1 to 2},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {2},
  pages     = {21:1--21:17},
  year      = {2009},
  url       = {https://doi.org/10.1145/1497290.1497297},
  doi       = {10.1145/1497290.1497297},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EvenFKN09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Farach-ColtonFM09,
  author    = {Martin Farach{-}Colton and
               Rohan J. Fernandes and
               Miguel A. Mosteiro},
  title     = {Bootstrapping a hop-optimal network in the weak sensor model},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {37:1--37:30},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597040},
  doi       = {10.1145/1597036.1597040},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Farach-ColtonFM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Fernandez-BacaV09,
  author    = {David Fern{\'{a}}ndez{-}Baca and
               Balaji Venkatachalam},
  title     = {Parametric analysis for ungapped Markov models of evolution},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {44:1--44:20},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597048},
  doi       = {10.1145/1597036.1597048},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Fernandez-BacaV09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FinocchiGI09,
  author    = {Irene Finocchi and
               Fabrizio Grandoni and
               Giuseppe F. Italiano},
  title     = {Resilient dictionaries},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {1:1--1:19},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644016},
  doi       = {10.1145/1644015.1644016},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FinocchiGI09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Gabow09,
  author    = {Harold N. Gabow},
  title     = {Foreword to special issue on {SODA} 2007},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {3},
  pages     = {25:1},
  year      = {2009},
  url       = {https://doi.org/10.1145/1541885.1541886},
  doi       = {10.1145/1541885.1541886},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Gabow09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GamzuS09,
  author    = {Iftah Gamzu and
               Danny Segev},
  title     = {Improved online algorithms for the sorting buffer problem on line
               metrics},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {15:1--15:14},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644030},
  doi       = {10.1145/1644015.1644030},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GamzuS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GaspersKLT09,
  author    = {Serge Gaspers and
               Dieter Kratsch and
               Mathieu Liedloff and
               Ioan Todinca},
  title     = {Exponential time algorithms for the minimum dominating set problem
               on some graph classes},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {9:1--9:21},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644024},
  doi       = {10.1145/1644015.1644024},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GaspersKLT09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GiyoraK09,
  author    = {Yoav Giyora and
               Haim Kaplan},
  title     = {Optimal dynamic vertical ray shooting in rectilinear planar subdivisions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {3},
  pages     = {28:1--28:51},
  year      = {2009},
  url       = {https://doi.org/10.1145/1541885.1541889},
  doi       = {10.1145/1541885.1541889},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GiyoraK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GolubchikKKTZ09,
  author    = {Leana Golubchik and
               Sanjeev Khanna and
               Samir Khuller and
               Ramakrishna Thurimella and
               An Zhu},
  title     = {Approximation algorithms for data placement on parallel disks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {34:1--34:26},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597037},
  doi       = {10.1145/1597036.1597037},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GolubchikKKTZ09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GuhaMV09,
  author    = {Sudipto Guha and
               Andrew McGregor and
               Suresh Venkatasubramanian},
  title     = {Sublinear estimation of entropy and information distances},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {35:1--35:16},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597038},
  doi       = {10.1145/1597036.1597038},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GuhaMV09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HassinLS09,
  author    = {Refael Hassin and
               Asaf Levin and
               Maxim Sviridenko},
  title     = {Approximating the minimum quadratic assignment problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {18:1--18:10},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644033},
  doi       = {10.1145/1644015.1644033},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HassinLS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HayS09,
  author    = {David Hay and
               Gabriel Scalosub},
  title     = {Jitter regulation for multiple streams},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {12:1--12:19},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644027},
  doi       = {10.1145/1644015.1644027},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HayS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ItoI09,
  author    = {Hiro Ito and
               Kazuo Iwama},
  title     = {Enumeration of isolated cliques and pseudo-cliques},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {40:1--40:21},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597044},
  doi       = {10.1145/1597036.1597044},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ItoI09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KaoSS09,
  author    = {Ming{-}Yang Kao and
               Manan Sanghi and
               Robert T. Schweller},
  title     = {Randomized fast design of short {DNA} words},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {43:1--43:24},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597047},
  doi       = {10.1145/1597036.1597047},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KaoSS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Karakostas09,
  author    = {George Karakostas},
  title     = {A better approximation ratio for the vertex cover problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {41:1--41:8},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597045},
  doi       = {10.1145/1597036.1597045},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Karakostas09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Levin09,
  author    = {Asaf Levin},
  title     = {A generalized minimum cost \emph{k}-clustering},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {36:1--36:10},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597039},
  doi       = {10.1145/1597036.1597039},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Levin09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LiDX09,
  author    = {Guojun Li and
               Xiaotie Deng and
               Ying Xu},
  title     = {A polynomial-time approximation scheme for embedding hypergraph in
               a cycle},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {2},
  pages     = {20:1--20:12},
  year      = {2009},
  url       = {https://doi.org/10.1145/1497290.1497296},
  doi       = {10.1145/1497290.1497296},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LiDX09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MarkoR09,
  author    = {Sharon Marko and
               Dana Ron},
  title     = {Approximating the distance to properties in bounded-degree and general
               sparse graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {2},
  pages     = {22:1--22:28},
  year      = {2009},
  url       = {https://doi.org/10.1145/1497290.1497298},
  doi       = {10.1145/1497290.1497298},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MarkoR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MehlhornM09,
  author    = {Kurt Mehlhorn and
               Dimitrios Michail},
  title     = {Minimum cycle bases: Faster and simpler},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {8:1--8:13},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644023},
  doi       = {10.1145/1644015.1644023},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MehlhornM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NguyenS09,
  author    = {Phong Q. Nguyen and
               Damien Stehl{\'{e}}},
  title     = {Low-dimensional lattice basis reduction revisited},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {46:1--46:48},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597050},
  doi       = {10.1145/1597036.1597050},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/NguyenS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Nutov09,
  author    = {Zeev Nutov},
  title     = {Approximating connectivity augmentation problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {5:1--5:19},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644020},
  doi       = {10.1145/1644015.1644020},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Nutov09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Pettie09,
  author    = {Seth Pettie},
  title     = {Low distortion spanners},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {1},
  pages     = {7:1--7:22},
  year      = {2009},
  url       = {https://doi.org/10.1145/1644015.1644022},
  doi       = {10.1145/1644015.1644022},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Pettie09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RabaniS09,
  author    = {Yuval Rabani and
               Gabriel Scalosub},
  title     = {Bicriteria approximation tradeoff for the node-cost budget problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {2},
  pages     = {19:1--19:14},
  year      = {2009},
  url       = {https://doi.org/10.1145/1497290.1497295},
  doi       = {10.1145/1497290.1497295},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RabaniS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ReedW09,
  author    = {Bruce A. Reed and
               David R. Wood},
  title     = {A linear-time algorithm to find a separator in a graph excluding a
               minor},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {39:1--39:16},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597043},
  doi       = {10.1145/1597036.1597043},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ReedW09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Ruzic09,
  author    = {Milan Ruzic},
  title     = {Making deterministic signatures quickly},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {3},
  pages     = {26:1--26:26},
  year      = {2009},
  url       = {https://doi.org/10.1145/1541885.1541887},
  doi       = {10.1145/1541885.1541887},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Ruzic09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ScottS09,
  author    = {Alexander D. Scott and
               Gregory B. Sorkin},
  title     = {Polynomial constraint satisfaction problems, graph bisection, and
               the Ising partition function},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {4},
  pages     = {45:1--45:27},
  year      = {2009},
  url       = {https://doi.org/10.1145/1597036.1597049},
  doi       = {10.1145/1597036.1597049},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ScottS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AbrahamGMNT08,
  author    = {Ittai Abraham and
               Cyril Gavoille and
               Dahlia Malkhi and
               Noam Nisan and
               Mikkel Thorup},
  title     = {Compact name-independent routing with minimum stretch},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {37:1--37:12},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367077},
  doi       = {10.1145/1367064.1367077},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AbrahamGMNT08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AgarwalKS08,
  author    = {Pankaj K. Agarwal and
               Haim Kaplan and
               Micha Sharir},
  title     = {Kinetic and dynamic data structures for closest pair and all nearest
               neighbors},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {4:1--4:37},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435379},
  doi       = {10.1145/1435375.1435379},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AgarwalKS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AgarwalSW08,
  author    = {Pankaj K. Agarwal and
               Micha Sharir and
               Emo Welzl},
  title     = {Algorithms for center and Tverberg points},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {5:1--5:20},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435380},
  doi       = {10.1145/1435375.1435380},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AgarwalSW08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AielloKM08,
  author    = {William Aiello and
               Alexander Kesselman and
               Yishay Mansour},
  title     = {Competitive buffer management for shared-memory switches},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {3:1--3:16},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435378},
  doi       = {10.1145/1435375.1435378},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AielloKM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AjwaniFM08,
  author    = {Deepak Ajwani and
               Tobias Friedrich and
               Ulrich Meyer},
  title     = {An \emph{O}(\emph{n}\({}^{\mbox{2.75}}\)) algorithm for incremental
               topological ordering},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {39:1--39:14},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383370},
  doi       = {10.1145/1383369.1383370},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AjwaniFM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlonBDFHS08,
  author    = {Noga Alon and
               Mihai Badoiu and
               Erik D. Demaine and
               Martin Farach{-}Colton and
               Mohammad Taghi Hajiaghayi and
               Anastasios Sidiropoulos},
  title     = {Ordinal embeddings of minimum relaxation: General properties, trees,
               and ultrametrics},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {46:1--46:21},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383377},
  doi       = {10.1145/1383369.1383377},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AlonBDFHS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlonsoR08,
  author    = {Laurent Alonso and
               Edward M. Reingold},
  title     = {Determining plurality},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {26:1--26:19},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367066},
  doi       = {10.1145/1367064.1367066},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlonsoR08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlonsoR08a,
  author    = {Laurent Alonso and
               Edward M. Reingold},
  title     = {Average-case lower bounds for the plurality problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {27:1--27:17},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367067},
  doi       = {10.1145/1367064.1367067},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlonsoR08a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AnshelevichZ08,
  author    = {Elliot Anshelevich and
               Lisa Zhang},
  title     = {Path decomposition under a new cost measure with applications to optical
               network design},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {15:1--15:20},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328926},
  doi       = {10.1145/1328911.1328926},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AnshelevichZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ArgeBHY08,
  author    = {Lars Arge and
               Mark de Berg and
               Herman J. Haverkort and
               Ke Yi},
  title     = {The priority R-tree: {A} practically efficient and worst-case optimal
               R-tree},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {9:1--9:30},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328920},
  doi       = {10.1145/1328911.1328920},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ArgeBHY08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AzrielSS08,
  author    = {Dany Azriel and
               Noam Solomon and
               Shay Solomon},
  title     = {On an infinite family of solvable Hanoi graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {13:1--13:22},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435388},
  doi       = {10.1145/1435375.1435388},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AzrielSS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Bar-NoyCS08,
  author    = {Amotz Bar{-}Noy and
               Panagiotis Cheilaris and
               Shakhar Smorodinsky},
  title     = {Deterministic conflict-free coloring for intervals: From offline to
               online},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {44:1--44:18},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383375},
  doi       = {10.1145/1383369.1383375},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Bar-NoyCS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BarbayK08,
  author    = {J{\'{e}}r{\'{e}}my Barbay and
               Claire Kenyon},
  title     = {Alternation and redundancy analysis of the intersection problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {4:1--4:18},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328915},
  doi       = {10.1145/1328911.1328915},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BarbayK08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BerendST08,
  author    = {Daniel Berend and
               Steven Skiena and
               Yochai Twitto},
  title     = {Combinatorial dominance guarantees for problems with infeasible solutions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {8:1--8:29},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435383},
  doi       = {10.1145/1435375.1435383},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BerendST08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BlandfordB08,
  author    = {Daniel K. Blandford and
               Guy E. Blelloch},
  title     = {Compact dictionaries for variable-length keys and data with applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {17:1--17:25},
  year      = {2008},
  url       = {https://doi.org/10.1145/1361192.1361194},
  doi       = {10.1145/1361192.1361194},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BlandfordB08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Blaser08,
  author    = {Markus Bl{\"{a}}ser},
  title     = {A new approximation algorithm for the asymmetric {TSP} with triangle
               inequality},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {47:1--47:15},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383378},
  doi       = {10.1145/1383369.1383378},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Blaser08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BoyarM08,
  author    = {Joan Boyar and
               Paul Medvedev},
  title     = {The relative worst order ratio applied to seat reservation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {48:1--48:22},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383379},
  doi       = {10.1145/1383369.1383379},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BoyarM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BrandstadtLS08,
  author    = {Andreas Brandst{\"{a}}dt and
               Van Bang Le and
               R. Sritharan},
  title     = {Structure and linear-time recognition of 4-leaf powers},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {11:1--11:22},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435386},
  doi       = {10.1145/1435375.1435386},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BrandstadtLS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Buchsbaum08,
  author    = {Adam L. Buchsbaum},
  title     = {Guest editorial},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {16:1},
  year      = {2008},
  url       = {https://doi.org/10.1145/1361192.1361193},
  doi       = {10.1145/1361192.1361193},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Buchsbaum08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BuchsbaumGPV08,
  author    = {Adam L. Buchsbaum and
               Emden R. Gansner and
               Cecilia Magdalena Procopiuc and
               Suresh Venkatasubramanian},
  title     = {Rectangular layouts and contact graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {8:1--8:28},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328919},
  doi       = {10.1145/1328911.1328919},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BuchsbaumGPV08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChandranMOPSS08,
  author    = {Nishanth Chandran and
               Ryan Moriarty and
               Rafail Ostrovsky and
               Omkant Pandey and
               Mohammad Ali Safari and
               Amit Sahai},
  title     = {Improved algorithms for optimal embeddings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {45:1--45:14},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383376},
  doi       = {10.1145/1383369.1383376},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChandranMOPSS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChawlaGR08,
  author    = {Shuchi Chawla and
               Anupam Gupta and
               Harald R{\"{a}}cke},
  title     = {Embeddings of negative-type metrics and an improved approximation
               to generalized sparsest cut},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {22:1--22:18},
  year      = {2008},
  url       = {https://doi.org/10.1145/1361192.1361199},
  doi       = {10.1145/1361192.1361199},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChawlaGR08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChenLLJ08,
  author    = {Xin Chen and
               Lan Liu and
               Zheng Liu and
               Tao Jiang},
  title     = {On the minimum common integer partition problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {12:1--12:18},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435387},
  doi       = {10.1145/1435375.1435387},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChenLLJ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChuzhoyGNS08,
  author    = {Julia Chuzhoy and
               Anupam Gupta and
               Joseph Naor and
               Amitabh Sinha},
  title     = {On the approximability of some network design problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {23:1--23:17},
  year      = {2008},
  url       = {https://doi.org/10.1145/1361192.1361200},
  doi       = {10.1145/1361192.1361200},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChuzhoyGNS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CohenFIKP08,
  author    = {Reuven Cohen and
               Pierre Fraigniaud and
               David Ilcinkas and
               Amos Korman and
               David Peleg},
  title     = {Label-guided graph exploration by a finite automaton},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {42:1--42:18},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383373},
  doi       = {10.1145/1383369.1383373},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CohenFIKP08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CzumajS08,
  author    = {Artur Czumaj and
               Christian Sohler},
  title     = {Testing Euclidean minimum spanning trees in the plane},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {31:1--31:23},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367071},
  doi       = {10.1145/1367064.1367071},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CzumajS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DinitzS08,
  author    = {Yefim Dinitz and
               Shay Solomon},
  title     = {Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {25:1--25:9},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367065},
  doi       = {10.1145/1367064.1367065},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DinitzS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ElmasryJK08,
  author    = {Amr Elmasry and
               Claus Jensen and
               Jyrki Katajainen},
  title     = {Multipartite priority queues},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {14:1--14:19},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435389},
  doi       = {10.1145/1435375.1435389},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ElmasryJK08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EvenLRSSS08,
  author    = {Guy Even and
               Retsef Levi and
               Dror Rawitz and
               Baruch Schieber and
               Shimon Shahar and
               Maxim Sviridenko},
  title     = {Algorithms for capacitated rectangle stabbing and lot sizing with
               joint set-up costs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {34:1--34:17},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367074},
  doi       = {10.1145/1367064.1367074},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EvenLRSSS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FominGPS08,
  author    = {Fedor V. Fomin and
               Fabrizio Grandoni and
               Artem V. Pyatkin and
               Alexey A. Stepanov},
  title     = {Combinatorial bounds via measure and conquer: Bounding minimal dominating
               sets and applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {9:1--9:17},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435384},
  doi       = {10.1145/1435375.1435384},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FominGPS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FotakisKS08,
  author    = {Dimitris Fotakis and
               Spyros C. Kontogiannis and
               Paul G. Spirakis},
  title     = {Atomic congestion games among coalitions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {52:1--52:27},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383383},
  doi       = {10.1145/1383369.1383383},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FotakisKS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FranceschiniG08,
  author    = {Gianni Franceschini and
               Roberto Grossi},
  title     = {No sorting? better searching!},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {2:1--2:13},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328913},
  doi       = {10.1145/1328911.1328913},
  timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FranceschiniG08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FusySP08,
  author    = {{\'{E}}ric Fusy and
               Gilles Schaeffer and
               Dominique Poulalhon},
  title     = {Dissections, orientations, and trees with applications to optimal
               mesh encoding and random sampling},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {19:1--19:48},
  year      = {2008},
  url       = {https://doi.org/10.1145/1361192.1361196},
  doi       = {10.1145/1361192.1361196},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FusySP08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GabowN08,
  author    = {Harold N. Gabow and
               Shuxin Nie},
  title     = {Finding a long directed cycle},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {7:1--7:21},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328918},
  doi       = {10.1145/1328911.1328918},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GabowN08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GandhiHKS08,
  author    = {Rajiv Gandhi and
               Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Guy Kortsarz and
               Hadas Shachnai},
  title     = {Improved bounds for scheduling conflicting jobs with minsum criteria},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {11:1--11:20},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328922},
  doi       = {10.1145/1328911.1328922},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GandhiHKS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GoldwasserP08,
  author    = {Michael H. Goldwasser and
               Mark Pedigo},
  title     = {Online nonpreemptive scheduling of equal-length jobs on two identical
               machines},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {2:1--2:18},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435377},
  doi       = {10.1145/1435375.1435377},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GoldwasserP08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GrandoniKP08,
  author    = {Fabrizio Grandoni and
               Jochen K{\"{o}}nemann and
               Alessandro Panconesi},
  title     = {Distributed weighted vertex cover via maximal matchings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {6:1--6:12},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435381},
  doi       = {10.1145/1435375.1435381},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GrandoniKP08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GuT08,
  author    = {Qian{-}Ping Gu and
               Hisao Tamaki},
  title     = {Optimal branch-decomposition of planar graphs in \emph{O}(\emph{n}\({}^{\mbox{3}}\))
               Time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {30:1--30:13},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367070},
  doi       = {10.1145/1367064.1367070},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GuT08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GudmundssonLNS08,
  author    = {Joachim Gudmundsson and
               Christos Levcopoulos and
               Giri Narasimhan and
               Michiel H. M. Smid},
  title     = {Approximate distance oracles for geometric spanners},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {10:1--10:34},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328921},
  doi       = {10.1145/1328911.1328921},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/GudmundssonLNS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GuerraouiLPP08,
  author    = {Rachid Guerraoui and
               Ron R. Levy and
               Bastian Pochon and
               Jim Pugh},
  title     = {The collective memory of amnesic processes},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {12:1--12:31},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328923},
  doi       = {10.1145/1328911.1328923},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GuerraouiLPP08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Ibarra08,
  author    = {Louis Ibarra},
  title     = {Fully dynamic algorithms for chordal graphs and split graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {40:1--40:20},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383371},
  doi       = {10.1145/1383369.1383371},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Ibarra08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ImmorlicaMM08,
  author    = {Nicole Immorlica and
               Mohammad Mahdian and
               Vahab S. Mirrokni},
  title     = {Limitations of cross-monotonic cost-sharing schemes},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {24:1--24:25},
  year      = {2008},
  url       = {https://doi.org/10.1145/1361192.1361201},
  doi       = {10.1145/1361192.1361201},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ImmorlicaMM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KaplanT08,
  author    = {Haim Kaplan and
               Robert Endre Tarjan},
  title     = {Thin heaps, thick heaps},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {3:1--3:14},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328914},
  doi       = {10.1145/1328911.1328914},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KaplanT08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Karakostas08,
  author    = {George Karakostas},
  title     = {Faster approximation schemes for fractional multicommodity flow problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {13:1--13:17},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328924},
  doi       = {10.1145/1328911.1328924},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Karakostas08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Kolluri08,
  author    = {Ravi Krishna Kolluri},
  title     = {Provably good moving least squares},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {18:1--18:25},
  year      = {2008},
  url       = {https://doi.org/10.1145/1361192.1361195},
  doi       = {10.1145/1361192.1361195},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Kolluri08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KormanP08,
  author    = {Amos Korman and
               David Peleg},
  title     = {Dynamic routing schemes for graphs with low local density},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {41:1--41:18},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383372},
  doi       = {10.1145/1383369.1383372},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KormanP08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KowalskiS08,
  author    = {Dariusz R. Kowalski and
               Alexander A. Shvartsman},
  title     = {Writing-all deterministically and optimally using a nontrivial number
               of asynchronous processors},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {33:1--33:22},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367073},
  doi       = {10.1145/1367064.1367073},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KowalskiS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LemireK08,
  author    = {Daniel Lemire and
               Owen Kaser},
  title     = {Hierarchical bin buffering: Online local moments for dynamic external
               memory arrays},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {14:1--14:31},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328925},
  doi       = {10.1145/1328911.1328925},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LemireK08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LuY08,
  author    = {Hsueh{-}I Lu and
               Chia{-}Chi Yeh},
  title     = {Balanced parentheses strike back},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {28:1--28:13},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367068},
  doi       = {10.1145/1367064.1367068},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LuY08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MakinenN08,
  author    = {Veli M{\"{a}}kinen and
               Gonzalo Navarro},
  title     = {Dynamic entropy-compressed sequences and full-text indexes},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {32:1--32:38},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367072},
  doi       = {10.1145/1367064.1367072},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MakinenN08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MassbergV08,
  author    = {Jens Ma{\ss}berg and
               Jens Vygen},
  title     = {Approximation algorithms for a facility location problem with service
               capacities},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {50:1--50:15},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383381},
  doi       = {10.1145/1383369.1383381},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MassbergV08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NiebergHK08,
  author    = {Tim Nieberg and
               Johann L. Hurink and
               Walter Kern},
  title     = {Approximation schemes for wireless networks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {49:1--49:17},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383380},
  doi       = {10.1145/1383369.1383380},
  timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/NiebergHK08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Oum08,
  author    = {Sang{-}il Oum},
  title     = {Approximating rank-width and clique-width quickly},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {10:1--10:20},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435385},
  doi       = {10.1145/1435375.1435385},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Oum08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PettieR08,
  author    = {Seth Pettie and
               Vijaya Ramachandran},
  title     = {Randomized minimum spanning tree algorithms using exponentially fewer
               random bits},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {5:1--5:27},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328916},
  doi       = {10.1145/1328911.1328916},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/PettieR08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PruhsUW08,
  author    = {Kirk Pruhs and
               Patchrawat Uthaisombut and
               Gerhard J. Woeginger},
  title     = {Getting the best response for your erg},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {38:1--38:17},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367078},
  doi       = {10.1145/1367064.1367078},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/PruhsUW08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Roditty08,
  author    = {Liam Roditty},
  title     = {A faster and simpler fully dynamic transitive closure},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {6:1--6:16},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328917},
  doi       = {10.1145/1328911.1328917},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Roditty08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RodittyTZ08,
  author    = {Liam Roditty and
               Mikkel Thorup and
               Uri Zwick},
  title     = {Roundtrip spanners and roundtrip routing in directed graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {29:1--29:17},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367069},
  doi       = {10.1145/1367064.1367069},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RodittyTZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Ruzic08,
  author    = {Milan Ruzic},
  title     = {Uniform deterministic dictionaries},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {1},
  pages     = {1:1--1:23},
  year      = {2008},
  url       = {https://doi.org/10.1145/1328911.1328912},
  doi       = {10.1145/1328911.1328912},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Ruzic08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SandersS08,
  author    = {Peter Sanders and
               David Steurer},
  title     = {An asymptotic approximation scheme for multigraph edge coloring},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {21:1--21:24},
  year      = {2008},
  url       = {https://doi.org/10.1145/1361192.1361198},
  doi       = {10.1145/1361192.1361198},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/SandersS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SuzukiT08,
  author    = {Akiko Suzuki and
               Takeshi Tokuyama},
  title     = {Dense subgraph problems with output-density conditions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {43:1--43:18},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383374},
  doi       = {10.1145/1383369.1383374},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/SuzukiT08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SwamyS08,
  author    = {Chaitanya Swamy and
               David B. Shmoys},
  title     = {Fault-tolerant facility location},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {4},
  pages     = {51:1--51:27},
  year      = {2008},
  url       = {https://doi.org/10.1145/1383369.1383382},
  doi       = {10.1145/1383369.1383382},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/SwamyS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/TorngM08,
  author    = {Eric Torng and
               Jason McCullough},
  title     = {{SRPT} optimally utilizes faster machines to minimize flow time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {1:1--1:25},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435376},
  doi       = {10.1145/1435375.1435376},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/TorngM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/VeghB08,
  author    = {L{\'{a}}szl{\'{o}} A. V{\'{e}}gh and
               Andr{\'{a}}s A. Bencz{\'{u}}r},
  title     = {Primal-dual approach for directed vertex connectivity augmentation
               and generalizations},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {20:1--20:21},
  year      = {2008},
  url       = {https://doi.org/10.1145/1361192.1361197},
  doi       = {10.1145/1361192.1361197},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/VeghB08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Vishwanathan08,
  author    = {Sundar Vishwanathan},
  title     = {On hard instances of approximate vertex cover},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {5},
  number    = {1},
  pages     = {7:1--7:6},
  year      = {2008},
  url       = {https://doi.org/10.1145/1435375.1435382},
  doi       = {10.1145/1435375.1435382},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Vishwanathan08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/YuLW08,
  author    = {Hung{-}I Yu and
               Tzu{-}Chin Lin and
               Biing{-}Feng Wang},
  title     = {Improved algorithms for the minmax-regret 1-center and 1-median problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {36:1--36:27},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367076},
  doi       = {10.1145/1367064.1367076},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/YuLW08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ZhangO08,
  author    = {Cun{-}Quan Zhang and
               Yongbin Ou},
  title     = {Clustering, community partition and disjoint spanning trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {35:1--35:26},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367075},
  doi       = {10.1145/1367064.1367075},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ZhangO08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlbersF07,
  author    = {Susanne Albers and
               Hiroshi Fujiwara},
  title     = {Energy-efficient algorithms for flow time minimization},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {49},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290686},
  doi       = {10.1145/1290672.1290686},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlbersF07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlonGKS07,
  author    = {Noga Alon and
               Venkatesan Guruswami and
               Tali Kaufman and
               Madhu Sudan},
  title     = {Guessing secrets efficiently via list decoding},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {42},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290679},
  doi       = {10.1145/1290672.1290679},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlonGKS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AmirLLS07,
  author    = {Amihood Amir and
               Gad M. Landau and
               Moshe Lewenstein and
               Dina Sokol},
  title     = {Dynamic text and static pattern matching},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {19},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240242},
  doi       = {10.1145/1240233.1240242},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AmirLLS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AndrewsZ07,
  author    = {Matthew Andrews and
               Lisa Zhang},
  title     = {Routing and scheduling in multihop wireless networks with time-varying
               channels},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {33},
  year      = {2007},
  url       = {https://doi.org/10.1145/1273340.1273349},
  doi       = {10.1145/1273340.1273349},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AndrewsZ07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ArcherT07,
  author    = {Aaron Archer and
               {\'{E}}va Tardos},
  title     = {Frugal path mechanisms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {1},
  pages     = {3:1--3:22},
  year      = {2007},
  url       = {https://doi.org/10.1145/1219944.1219948},
  doi       = {10.1145/1219944.1219948},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ArcherT07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AryaMM07,
  author    = {Sunil Arya and
               Theocharis Malamatos and
               David M. Mount},
  title     = {A simple entropy-based algorithm for planar point location},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {17},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240240},
  doi       = {10.1145/1240233.1240240},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AryaMM07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AspnesS07,
  author    = {James Aspnes and
               Gauri Shah},
  title     = {Skip graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {37},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290674},
  doi       = {10.1145/1290672.1290674},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AspnesS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AulettaPPP07,
  author    = {Vincenzo Auletta and
               Roberto De Prisco and
               Paolo Penna and
               Giuseppe Persiano},
  title     = {Routing selfish unsplittable traffic},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {52},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290689},
  doi       = {10.1145/1290672.1290689},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AulettaPPP07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BagchiCEG07,
  author    = {Amitabha Bagchi and
               Amitabh Chaudhary and
               David Eppstein and
               Michael T. Goodrich},
  title     = {Deterministic sampling and range counting in geometric data streams},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {16},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240239},
  doi       = {10.1145/1240233.1240239},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BagchiCEG07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BansalD07,
  author    = {Nikhil Bansal and
               Kedar Dhamdhere},
  title     = {Minimizing weighted flow time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {39},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290676},
  doi       = {10.1145/1290672.1290676},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BansalD07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Bar-NoyLT07,
  author    = {Amotz Bar{-}Noy and
               Richard E. Ladner and
               Tami Tamir},
  title     = {Windows scheduling as a restricted version of bin packing},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {28},
  year      = {2007},
  url       = {https://doi.org/10.1145/1273340.1273344},
  doi       = {10.1145/1273340.1273344},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Bar-NoyLT07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BecchettiKLP07,
  author    = {Luca Becchetti and
               Jochen K{\"{o}}nemann and
               Stefano Leonardi and
               Martin P{\'{a}}l},
  title     = {Sharing the cost more efficiently: Improved approximation for multicommodity
               rent-or-buy},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {23},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240246},
  doi       = {10.1145/1240233.1240246},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BecchettiKLP07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BhatiaCFN07,
  author    = {Randeep Bhatia and
               Julia Chuzhoy and
               Ari Freund and
               Joseph Naor},
  title     = {Algorithmic aspects of bandwidth trading},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {1},
  pages     = {10:1--10:19},
  year      = {2007},
  url       = {https://doi.org/10.1145/1219944.1219956},
  doi       = {10.1145/1219944.1219956},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BhatiaCFN07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BoyarF07,
  author    = {Joan Boyar and
               Lene M. Favrholdt},
  title     = {The relative worst order ratio for online algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {22},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240245},
  doi       = {10.1145/1240233.1240245},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BoyarF07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CarmoFKLMOPT07,
  author    = {Renato Carmo and
               Tom{\'{a}}s Feder and
               Yoshiharu Kohayakawa and
               Eduardo Sany Laber and
               Rajeev Motwani and
               Liadan O'Callaghan and
               Rina Panigrahy and
               Dilys Thomas},
  title     = {Querying priced information in databases: The conjunctive case},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {1},
  pages     = {9:1--9:22},
  year      = {2007},
  url       = {https://doi.org/10.1145/1219944.1219955},
  doi       = {10.1145/1219944.1219955},
  timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CarmoFKLMOPT07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChanHLS07,
  author    = {Ho{-}Leung Chan and
               Wing{-}Kai Hon and
               Tak Wah Lam and
               Kunihiko Sadakane},
  title     = {Compressed indexes for dynamic text collections},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {21},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240244},
  doi       = {10.1145/1240233.1240244},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChanHLS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriK07,
  author    = {Chandra Chekuri and
               Sanjeev Khanna},
  title     = {Edge-disjoint paths revisited},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {46},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290683},
  doi       = {10.1145/1290672.1290683},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChekuriK07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriMS07,
  author    = {Chandra Chekuri and
               Marcelo Mydlarz and
               F. Bruce Shepherd},
  title     = {Multicommodity demand flow in a tree and packing integer programs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {27},
  year      = {2007},
  url       = {https://doi.org/10.1145/1273340.1273343},
  doi       = {10.1145/1273340.1273343},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChekuriMS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CheriyanS07,
  author    = {Joseph Cheriyan and
               Mohammad R. Salavatipour},
  title     = {Packing element-disjoint steiner trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {47},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290684},
  doi       = {10.1145/1290672.1290684},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CheriyanS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChernFH07,
  author    = {Hua{-}Huai Chern and
               Michael Fuchs and
               Hsien{-}Kuei Hwang},
  title     = {Phase changes in random point quadtrees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {12},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240235},
  doi       = {10.1145/1240233.1240235},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChernFH07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChrobakJST07,
  author    = {Marek Chrobak and
               Wojciech Jawor and
               Jir{\'{\i}} Sgall and
               Tom{\'{a}}s Tich{\'{y}}},
  title     = {Improved online algorithms for buffer management in QoS switches},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {50},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290687},
  doi       = {10.1145/1290672.1290687},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChrobakJST07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CirianiFLM07,
  author    = {Valentina Ciriani and
               Paolo Ferragina and
               Fabrizio Luccio and
               S. Muthukrishnan},
  title     = {A data structure for a sequence of string accesses in external memory},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {1},
  pages     = {6:1--6:23},
  year      = {2007},
  url       = {https://doi.org/10.1145/1219944.1219952},
  doi       = {10.1145/1219944.1219952},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CirianiFLM07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CormodeM07,
  author    = {Graham Cormode and
               S. Muthukrishnan},
  title     = {The string edit distance matching problem with moves},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {1},
  pages     = {2:1--2:19},
  year      = {2007},
  url       = {https://doi.org/10.1145/1219944.1219947},
  doi       = {10.1145/1219944.1219947},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CormodeM07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CzumajV07,
  author    = {Artur Czumaj and
               Berthold V{\"{o}}cking},
  title     = {Tight bounds for worst-case equilibria},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {1},
  pages     = {4:1--4:17},
  year      = {2007},
  url       = {https://doi.org/10.1145/1219944.1219949},
  doi       = {10.1145/1219944.1219949},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CzumajV07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineIL07,
  author    = {Erik D. Demaine and
               John Iacono and
               Stefan Langerman},
  title     = {Retroactive data structures},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {13},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240236},
  doi       = {10.1145/1240233.1240236},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/DemaineIL07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ElkinK07,
  author    = {Michael Elkin and
               Guy Kortsarz},
  title     = {An improved algorithm for radio broadcast},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {1},
  pages     = {8:1--8:21},
  year      = {2007},
  url       = {https://doi.org/10.1145/1219944.1219954},
  doi       = {10.1145/1219944.1219954},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ElkinK07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein07,
  author    = {David Eppstein},
  title     = {Foreword to special issue on {SODA} 2002},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {1},
  pages     = {1},
  year      = {2007},
  url       = {https://doi.org/10.1145/1219944.1219946},
  doi       = {10.1145/1219944.1219946},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Eppstein07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Even-DarKM07,
  author    = {Eyal Even{-}Dar and
               Alexander Kesselman and
               Yishay Mansour},
  title     = {Convergence time to Nash equilibrium in load balancing},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {32},
  year      = {2007},
  url       = {https://doi.org/10.1145/1273340.1273348},
  doi       = {10.1145/1273340.1273348},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Even-DarKM07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FakcharoenpholHR07,
  author    = {Jittat Fakcharoenphol and
               Chris Harrelson and
               Satish Rao},
  title     = {The \emph{k}-traveling repairmen problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {40},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290677},
  doi       = {10.1145/1290672.1290677},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FakcharoenpholHR07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FengZ07,
  author    = {Jianxing Feng and
               Daming Zhu},
  title     = {Faster algorithms for sorting by transpositions and sorting by block
               interchanges},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {25},
  year      = {2007},
  url       = {https://doi.org/10.1145/1273340.1273341},
  doi       = {10.1145/1273340.1273341},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FengZ07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FerraginaMMN07,
  author    = {Paolo Ferragina and
               Giovanni Manzini and
               Veli M{\"{a}}kinen and
               Gonzalo Navarro},
  title     = {Compressed representations of sequences and full-text indexes},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {20},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240243},
  doi       = {10.1145/1240233.1240243},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/FerraginaMMN07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GabowBF07,
  author    = {Harold N. Gabow and
               Michael A. Bender and
               Martin Farach{-}Colton},
  title     = {Introduction to {SODA} 2002 and 2003 special issue},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {36},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290673},
  doi       = {10.1145/1290672.1290673},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GabowBF07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GuptaW07,
  author    = {Himanshu Gupta and
               Rephael Wenger},
  title     = {Constructing pairwise disjoint paths with few links},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {26},
  year      = {2007},
  url       = {https://doi.org/10.1145/1273340.1273342},
  doi       = {10.1145/1273340.1273342},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GuptaW07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HajiaghayiKRL07,
  author    = {Mohammad Taghi Hajiaghayi and
               Robert D. Kleinberg and
               Harald R{\"{a}}cke and
               Tom Leighton},
  title     = {Oblivious routing on node-capacitated and directed graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {51},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290688},
  doi       = {10.1145/1290672.1290688},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HajiaghayiKRL07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HalldorssonIMY07,
  author    = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Kazuo Iwama and
               Shuichi Miyazaki and
               Hiroki Yanagisawa},
  title     = {Improved approximation results for the stable marriage problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {30},
  year      = {2007},
  url       = {https://doi.org/10.1145/1273340.1273346},
  doi       = {10.1145/1273340.1273346},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HalldorssonIMY07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Han07,
  author    = {Yijie Han},
  title     = {Optimal parallel selection},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {38},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290675},
  doi       = {10.1145/1290672.1290675},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Han07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HaywardSS07,
  author    = {Ryan B. Hayward and
               Jeremy P. Spinrad and
               R. Sritharan},
  title     = {Improved algorithms for weakly chordal graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {14},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240237},
  doi       = {10.1145/1240233.1240237},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HaywardSS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HazayLS07,
  author    = {Carmit Hazay and
               Moshe Lewenstein and
               Dina Sokol},
  title     = {Approximate parameterized matching},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {29},
  year      = {2007},
  url       = {https://doi.org/10.1145/1273340.1273345},
  doi       = {10.1145/1273340.1273345},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HazayLS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HershbergerMS07,
  author    = {John Hershberger and
               Matthew Maxel and
               Subhash Suri},
  title     = {Finding the \emph{k} shortest simple paths: {A} new algorithm and
               its implementation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {45},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290682},
  doi       = {10.1145/1290672.1290682},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HershbergerMS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HershbergerSB07,
  author    = {John Hershberger and
               Subhash Suri and
               Amit M. Bhosle},
  title     = {On the difficulty of some shortest path problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {1},
  pages     = {5:1--5:15},
  year      = {2007},
  url       = {https://doi.org/10.1145/1219944.1219951},
  doi       = {10.1145/1219944.1219951},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HershbergerSB07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/IndykN07,
  author    = {Piotr Indyk and
               Assaf Naor},
  title     = {Nearest-neighbor-preserving embeddings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {31},
  year      = {2007},
  url       = {https://doi.org/10.1145/1273340.1273347},
  doi       = {10.1145/1273340.1273347},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/IndykN07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/IraniSG07,
  author    = {Sandy Irani and
               Sandeep K. Shukla and
               Rajesh Gupta},
  title     = {Algorithms for power savings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {41},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290678},
  doi       = {10.1145/1290672.1290678},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/IraniSG07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JansonS07,
  author    = {Svante Janson and
               Wojciech Szpankowski},
  title     = {Partial fillup and search time in {LC} tries},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {44},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290681},
  doi       = {10.1145/1290672.1290681},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/JansonS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Johnson07,
  author    = {David S. Johnson},
  title     = {The NP-completeness column: Finding needles in haystacks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {24},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240247},
  doi       = {10.1145/1240233.1240247},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Johnson07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Kauers07,
  author    = {Manuel Kauers},
  title     = {An algorithm for deciding zero equivalence of nested polynomially
               recurrent sequences},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {18},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240241},
  doi       = {10.1145/1240233.1240241},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Kauers07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KavithaMMP07,
  author    = {Telikepalli Kavitha and
               Kurt Mehlhorn and
               Dimitrios Michail and
               Katarzyna E. Paluch},
  title     = {Strongly stable matchings in time \emph{O}(\emph{nm}) and extension
               to the hospitals-residents problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {15},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240238},
  doi       = {10.1145/1240233.1240238},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KavithaMMP07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Khuller07,
  author    = {Samir Khuller},
  title     = {Problems column},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {35},
  year      = {2007},
  url       = {https://doi.org/10.1145/1273340.1273351},
  doi       = {10.1145/1273340.1273351},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Khuller07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KrivelevichNSYY07,
  author    = {Michael Krivelevich and
               Zeev Nutov and
               Mohammad R. Salavatipour and
               Jacques Verstra{\"{e}}te and
               Raphael Yuster},
  title     = {Approximation algorithms and hardness results for cycle packing problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {48},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290685},
  doi       = {10.1145/1290672.1290685},
  timestamp = {Sun, 17 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/KrivelevichNSYY07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NaorW07,
  author    = {Moni Naor and
               Udi Wieder},
  title     = {Novel architectures for {P2P} applications: The continuous-discrete
               approach},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {3},
  pages     = {34},
  year      = {2007},
  url       = {https://doi.org/10.1145/1273340.1273350},
  doi       = {10.1145/1273340.1273350},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/NaorW07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PanduranganU07,
  author    = {Gopal Pandurangan and
               Eli Upfal},
  title     = {Entropy-based bounds for online algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {1},
  pages     = {7:1--7:19},
  year      = {2007},
  url       = {https://doi.org/10.1145/1219944.1219953},
  doi       = {10.1145/1219944.1219953},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/PanduranganU07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RamanRS07,
  author    = {Rajeev Raman and
               Venkatesh Raman and
               Srinivasa Rao Satti},
  title     = {Succinct indexable dictionaries with applications to encoding \emph{k}-ary
               trees, prefix sums and multisets},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {4},
  pages     = {43},
  year      = {2007},
  url       = {https://doi.org/10.1145/1290672.1290680},
  doi       = {10.1145/1290672.1290680},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RamanRS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/VoronenkoP07,
  author    = {Yevgen Voronenko and
               Markus P{\"{u}}schel},
  title     = {Multiplierless multiple constant multiplication},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {3},
  number    = {2},
  pages     = {11},
  year      = {2007},
  url       = {https://doi.org/10.1145/1240233.1240234},
  doi       = {10.1145/1240233.1240234},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/VoronenkoP07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AgarwalAK06,
  author    = {Pankaj K. Agarwal and
               Boris Aronov and
               Vladlen Koltun},
  title     = {Efficient algorithms for bichromatic separability},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {2},
  pages     = {209--227},
  year      = {2006},
  url       = {https://doi.org/10.1145/1150334.1150338},
  doi       = {10.1145/1150334.1150338},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AgarwalAK06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlonAABN06,
  author    = {Noga Alon and
               Baruch Awerbuch and
               Yossi Azar and
               Niv Buchbinder and
               Joseph Naor},
  title     = {A general approach to online network optimization problems},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {640--660},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198522},
  doi       = {10.1145/1198513.1198522},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlonAABN06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlonMS06,
  author    = {Noga Alon and
               Dana Moshkovitz and
               Shmuel Safra},
  title     = {Algorithmic construction of sets for \emph{k}-restrictions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {2},
  pages     = {153--177},
  year      = {2006},
  url       = {https://doi.org/10.1145/1150334.1150336},
  doi       = {10.1145/1150334.1150336},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlonMS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AzarR06,
  author    = {Yossi Azar and
               Yossi Richter},
  title     = {An improved algorithm for {CIOQ} switches},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {2},
  pages     = {282--295},
  year      = {2006},
  url       = {https://doi.org/10.1145/1150334.1150342},
  doi       = {10.1145/1150334.1150342},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AzarR06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaswanaS06,
  author    = {Surender Baswana and
               Sandeep Sen},
  title     = {Approximate distance oracles for unweighted graphs in expected \emph{O}(\emph{n}\({}^{\mbox{2}}\))
               time},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {557--577},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198518},
  doi       = {10.1145/1198513.1198518},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BaswanaS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BeierCKV06,
  author    = {Ren{\'{e}} Beier and
               Artur Czumaj and
               Piotr Krysta and
               Berthold V{\"{o}}cking},
  title     = {Computing equilibria for a service provider game with (Im)perfect
               information},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {679--706},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198524},
  doi       = {10.1145/1198513.1198524},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/BeierCKV06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BerendS06,
  author    = {Daniel Berend and
               Amir Sapir},
  title     = {The cyclic multi-peg Tower of Hanoi},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {3},
  pages     = {297--317},
  year      = {2006},
  url       = {https://doi.org/10.1145/1159892.1159893},
  doi       = {10.1145/1159892.1159893},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/BerendS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemetrescuI06,
  author    = {Camil Demetrescu and
               Giuseppe F. Italiano},
  title     = {Experimental analysis of dynamic all pairs shortest path algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {578--601},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198519},
  doi       = {10.1145/1198513.1198519},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/DemetrescuI06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DrmotaP06,
  author    = {Michael Drmota and
               Helmut Prodinger},
  title     = {The register function for \emph{t}-ary trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {3},
  pages     = {318--334},
  year      = {2006},
  url       = {https://doi.org/10.1145/1159892.1159894},
  doi       = {10.1145/1159892.1159894},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DrmotaP06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DuncanKK06,
  author    = {Christian A. Duncan and
               Stephen G. Kobourov and
               V. S. Anil Kumar},
  title     = {Optimal constrained graph exploration},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {3},
  pages     = {380--402},
  year      = {2006},
  url       = {https://doi.org/10.1145/1159892.1159897},
  doi       = {10.1145/1159892.1159897},
  timestamp = {Fri, 08 Mar 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DuncanKK06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Eppstein06,
  author    = {David Eppstein},
  title     = {Quasiconvex analysis of multivariate recurrence equations for backtracking
               algorithms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {492--509},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198515},
  doi       = {10.1145/1198513.1198515},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Eppstein06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EpsteinS06,
  author    = {Leah Epstein and
               Rob van Stee},
  title     = {Online scheduling of splittable tasks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {1},
  pages     = {79--94},
  year      = {2006},
  url       = {https://doi.org/10.1145/1125994.1125999},
  doi       = {10.1145/1125994.1125999},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EpsteinS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EpsteinS06a,
  author    = {Leah Epstein and
               Rob van Stee},
  title     = {This side up!},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {2},
  pages     = {228--243},
  year      = {2006},
  url       = {https://doi.org/10.1145/1150334.1150339},
  doi       = {10.1145/1150334.1150339},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EpsteinS06a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EvansK06,
  author    = {William S. Evans and
               David G. Kirkpatrick},
  title     = {Optimally scheduling video-on-demand to minimize delay when sender
               and receiver bandwidth may differ},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {661--678},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198523},
  doi       = {10.1145/1198513.1198523},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EvansK06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FeigenbaumIMNSW06,
  author    = {Joan Feigenbaum and
               Yuval Ishai and
               Tal Malkin and
               Kobbi Nissim and
               Martin J. Strauss and
               Rebecca N. Wright},
  title     = {Secure multiparty computation of approximations},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {3},
  pages     = {435--472},
  year      = {2006},
  url       = {https://doi.org/10.1145/1159892.1159900},
  doi       = {10.1145/1159892.1159900},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FeigenbaumIMNSW06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FoschiniGGV06,
  author    = {Luca Foschini and
               Roberto Grossi and
               Ankur Gupta and
               Jeffrey Scott Vitter},
  title     = {When indexing equals compression: Experiments with compressing suffix
               arrays and applications},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {611--639},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198521},
  doi       = {10.1145/1198513.1198521},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/FoschiniGGV06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GandhiHKS06,
  author    = {Rajiv Gandhi and
               Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Guy Kortsarz and
               Hadas Shachnai},
  title     = {Improved results for data migration and open shop scheduling},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {1},
  pages     = {116--129},
  year      = {2006},
  url       = {https://doi.org/10.1145/1125994.1126001},
  doi       = {10.1145/1125994.1126001},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GandhiHKS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GearyRR06,
  author    = {Richard F. Geary and
               Rajeev Raman and
               Venkatesh Raman},
  title     = {Succinct ordinal trees with level-ancestor queries},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {510--534},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198516},
  doi       = {10.1145/1198513.1198516},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GearyRR06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GonzalezLP06,
  author    = {Teofilo F. Gonzalez and
               Joseph Y.{-}T. Leung and
               Michael Pinedo},
  title     = {Minimizing total completion time on uniform machines with deadline
               constraints},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {1},
  pages     = {95--115},
  year      = {2006},
  url       = {https://doi.org/10.1145/1125994.1126000},
  doi       = {10.1145/1125994.1126000},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GonzalezLP06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GrammGN06,
  author    = {Jens Gramm and
               Jiong Guo and
               Rolf Niedermeier},
  title     = {Pattern matching for arc-annotated sequences},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {1},
  pages     = {44--65},
  year      = {2006},
  url       = {https://doi.org/10.1145/1125994.1125997},
  doi       = {10.1145/1125994.1125997},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GrammGN06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HassinL06,
  author    = {Refael Hassin and
               Asaf Levin},
  title     = {The minimum generalized vertex cover problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {1},
  pages     = {66--78},
  year      = {2006},
  url       = {https://doi.org/10.1145/1125994.1125998},
  doi       = {10.1145/1125994.1125998},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HassinL06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HassinS06,
  author    = {Refael Hassin and
               Danny Segev},
  title     = {Robust subgraphs for trees and paths},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {2},
  pages     = {263--281},
  year      = {2006},
  url       = {https://doi.org/10.1145/1150334.1150341},
  doi       = {10.1145/1150334.1150341},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HassinS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Hegde06,
  author    = {Rajneesh Hegde},
  title     = {Finding 3-shredders efficiently},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {1},
  pages     = {14--43},
  year      = {2006},
  url       = {https://doi.org/10.1145/1125994.1125996},
  doi       = {10.1145/1125994.1125996},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Hegde06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HuoL06,
  author    = {Yumei Huo and
               Joseph Y.{-}T. Leung},
  title     = {Minimizing mean flow time for {UET} tasks},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {2},
  pages     = {244--262},
  year      = {2006},
  url       = {https://doi.org/10.1145/1150334.1150340},
  doi       = {10.1145/1150334.1150340},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HuoL06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/IrvingKMMP06,
  author    = {Robert W. Irving and
               Telikepalli Kavitha and
               Kurt Mehlhorn and
               Dimitrios Michail and
               Katarzyna E. Paluch},
  title     = {Rank-maximal matchings},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {602--610},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198520},
  doi       = {10.1145/1198513.1198520},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/IrvingKMMP06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JansenZ06,
  author    = {Klaus Jansen and
               Hu Zhang},
  title     = {An approximation algorithm for scheduling malleable tasks under general
               precedence constraints},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {3},
  pages     = {416--434},
  year      = {2006},
  url       = {https://doi.org/10.1145/1159892.1159899},
  doi       = {10.1145/1159892.1159899},
  timestamp = {Wed, 13 Mar 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/JansenZ06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Johnson06,
  author    = {David S. Johnson},
  title     = {The NP-completeness column: The many limits on approximation},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {3},
  pages     = {473--489},
  year      = {2006},
  url       = {https://doi.org/10.1145/1159892.1159901},
  doi       = {10.1145/1159892.1159901},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Johnson06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KatrielB06,
  author    = {Irit Katriel and
               Hans L. Bodlaender},
  title     = {Online topological ordering},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {3},
  pages     = {364--379},
  year      = {2006},
  url       = {https://doi.org/10.1145/1159892.1159896},
  doi       = {10.1145/1159892.1159896},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/KatrielB06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Khuller06,
  author    = {Samir Khuller},
  title     = {Problems column},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {1},
  pages     = {130--134},
  year      = {2006},
  url       = {https://doi.org/10.1145/1125994.1126002},
  doi       = {10.1145/1125994.1126002},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Khuller06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KorshL06,
  author    = {James F. Korsh and
               Paul LaFollette},
  title     = {A loopless Gray code for rooted trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {2},
  pages     = {135--152},
  year      = {2006},
  url       = {https://doi.org/10.1145/1150334.1150335},
  doi       = {10.1145/1150334.1150335},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KorshL06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KowalikK06,
  author    = {Lukasz Kowalik and
               Maciej Kurowski},
  title     = {Oracles for bounded-length shortest paths in planar graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {3},
  pages     = {335--363},
  year      = {2006},
  url       = {https://doi.org/10.1145/1159892.1159895},
  doi       = {10.1145/1159892.1159895},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/KowalikK06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Lau06,
  author    = {Lap Chi Lau},
  title     = {Bipartite roots of graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {2},
  pages     = {178--208},
  year      = {2006},
  url       = {https://doi.org/10.1145/1150334.1150337},
  doi       = {10.1145/1150334.1150337},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Lau06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Lopez-OrtizM06,
  author    = {Alejandro L{\'{o}}pez{-}Ortiz and
               J. Ian Munro},
  title     = {Foreword},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {491},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198514},
  doi       = {10.1145/1198513.1198514},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Lopez-OrtizM06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MendelsonTTZ06,
  author    = {Ran Mendelson and
               Robert Endre Tarjan and
               Mikkel Thorup and
               Uri Zwick},
  title     = {Melding priority queues},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {535--556},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198517},
  doi       = {10.1145/1198513.1198517},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MendelsonTTZ06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MooreRR06,
  author    = {Cristopher Moore and
               Daniel N. Rockmore and
               Alexander Russell},
  title     = {Generic quantum Fourier transforms},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {707--723},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198525},
  doi       = {10.1145/1198513.1198525},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MooreRR06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RamanSS06,
  author    = {Venkatesh Raman and
               Saket Saurabh and
               C. R. Subramanian},
  title     = {Faster fixed parameter tractable algorithms for finding feedback vertex
               sets},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {3},
  pages     = {403--415},
  year      = {2006},
  url       = {https://doi.org/10.1145/1159892.1159898},
  doi       = {10.1145/1159892.1159898},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RamanSS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Sawada06,
  author    = {Joe Sawada},
  title     = {Generating rooted and free plane trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {1},
  pages     = {1--13},
  year      = {2006},
  url       = {https://doi.org/10.1145/1125994.1125995},
  doi       = {10.1145/1125994.1125995},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Sawada06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AdlerR05,
  author    = {Micah Adler and
               Dan Rubenstein},
  title     = {Pricing multicasting in more flexible network models},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {48--73},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077469},
  doi       = {10.1145/1077464.1077469},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AdlerR05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlstrupHLT05,
  author    = {Stephen Alstrup and
               Jacob Holm and
               Kristian de Lichtenberg and
               Mikkel Thorup},
  title     = {Maintaining information in fully dynamic trees with top trees},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {2},
  pages     = {243--264},
  year      = {2005},
  url       = {https://doi.org/10.1145/1103963.1103966},
  doi       = {10.1145/1103963.1103966},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlstrupHLT05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlstrupHRT05,
  author    = {Stephen Alstrup and
               Thore Husfeldt and
               Theis Rauhe and
               Mikkel Thorup},
  title     = {Black box for constant-time insertion in priority queues (note)},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {102--106},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077471},
  doi       = {10.1145/1077464.1077471},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/AlstrupHRT05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CarvalhoC05,
  author    = {Marcelo H. de Carvalho and
               Joseph Cheriyan},
  title     = {An \emph{O}(\emph{VE}) algorithm for ear decompositions of matching-covered
               graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {2},
  pages     = {324--337},
  year      = {2005},
  url       = {https://doi.org/10.1145/1103963.1103969},
  doi       = {10.1145/1103963.1103969},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CarvalhoC05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CechlarovaF05,
  author    = {Katar{\'{\i}}na Cechl{\'{a}}rov{\'{a}} and
               Tam{\'{a}}s Fleiner},
  title     = {On a generalization of the stable roommates problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {143--156},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077474},
  doi       = {10.1145/1077464.1077474},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/CechlarovaF05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChrobakKS05,
  author    = {Marek Chrobak and
               Petr Kolman and
               Jir{\'{\i}} Sgall},
  title     = {The greedy algorithm for the minimum common string partition problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {2},
  pages     = {350--366},
  year      = {2005},
  url       = {https://doi.org/10.1145/1103963.1103971},
  doi       = {10.1145/1103963.1103971},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/ChrobakKS05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineFHT05,
  author    = {Erik D. Demaine and
               Fedor V. Fomin and
               Mohammad Taghi Hajiaghayi and
               Dimitrios M. Thilikos},
  title     = {Fixed-parameter algorithms for (\emph{k}, \emph{r})-center in planar
               graphs and map graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {33--47},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077468},
  doi       = {10.1145/1077464.1077468},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/DemaineFHT05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EdmondsP05,
  author    = {Jeff Edmonds and
               Kirk Pruhs},
  title     = {A maiden analysis of longest wait first},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {14--32},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077467},
  doi       = {10.1145/1077464.1077467},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EdmondsP05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Elkin05,
  author    = {Michael Elkin},
  title     = {Computing almost shortest paths},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {2},
  pages     = {283--323},
  year      = {2005},
  url       = {https://doi.org/10.1145/1103963.1103968},
  doi       = {10.1145/1103963.1103968},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Elkin05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EvenKS05,
  author    = {Guy Even and
               Guy Kortsarz and
               Wolfgang Slany},
  title     = {On network design problems: fixed cost flows and the covering steiner
               problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {74--101},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077470},
  doi       = {10.1145/1077464.1077470},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/EvenKS05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Gabow05,
  author    = {Harold N. Gabow},
  title     = {Editor's foreword},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {1},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077465},
  doi       = {10.1145/1077464.1077465},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Gabow05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GoelMP05,
  author    = {Ashish Goel and
               Adam Meyerson and
               Serge A. Plotkin},
  title     = {Approximate majorization and fair online load balancing},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {2},
  pages     = {338--349},
  year      = {2005},
  url       = {https://doi.org/10.1145/1103963.1103970},
  doi       = {10.1145/1103963.1103970},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GoelMP05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GrabnerHPT05,
  author    = {Peter J. Grabner and
               Clemens Heuberger and
               Helmut Prodinger and
               J{\"{o}}rg M. Thuswaldner},
  title     = {Analysis of linear combination algorithms in cryptography},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {123--142},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077473},
  doi       = {10.1145/1077464.1077473},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/GrabnerHPT05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Janson05,
  author    = {Svante Janson},
  title     = {Individual displacements for linear probing hashing with different
               insertion policies},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {2},
  pages     = {177--213},
  year      = {2005},
  url       = {https://doi.org/10.1145/1103963.1103964},
  doi       = {10.1145/1103963.1103964},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Janson05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Johnson05,
  author    = {David S. Johnson},
  title     = {The NP-completeness column},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {160--176},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077476},
  doi       = {10.1145/1077464.1077476},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Johnson05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JothiR05,
  author    = {Raja Jothi and
               Balaji Raghavachari},
  title     = {Approximation algorithms for the capacitated minimum spanning tree
               problem and its variants in network design},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {2},
  pages     = {265--282},
  year      = {2005},
  url       = {https://doi.org/10.1145/1103963.1103967},
  doi       = {10.1145/1103963.1103967},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/JothiR05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Khuller05,
  author    = {Samir Khuller},
  title     = {Problems column},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {157--159},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077475},
  doi       = {10.1145/1077464.1077475},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Khuller05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/VinkemeierH05,
  author    = {Doratha E. Drake Vinkemeier and
               Stefan Hougardy},
  title     = {A linear-time approximation algorithm for weighted matchings in graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {107--122},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077472},
  doi       = {10.1145/1077464.1077472},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/VinkemeierH05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Viola05,
  author    = {Alfredo Viola},
  title     = {Exact distribution of individual displacements in linear probing hashing},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {2},
  pages     = {214--242},
  year      = {2005},
  url       = {https://doi.org/10.1145/1103963.1103965},
  doi       = {10.1145/1103963.1103965},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/Viola05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/YusterZ05,
  author    = {Raphael Yuster and
               Uri Zwick},
  title     = {Fast sparse matrix multiplication},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {2--13},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077466},
  doi       = {10.1145/1077464.1077466},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/YusterZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics