Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/talg/talg13.bht:"
@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 = {Mon, 28 Aug 2023 01:00:00 +0200}, 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, 29 Dec 2020 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 = {Mon, 05 Feb 2024 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 = {Mon, 26 Oct 2020 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 = {Mon, 23 May 2022 01:00:00 +0200}, 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 = {Thu, 07 Jul 2022 01:00:00 +0200}, 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, 29 Dec 2020 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 = {Mon, 03 Jan 2022 00:00:00 +0100}, 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 = {Thu, 14 Oct 2021 01:00:00 +0200}, 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 = {Sat, 30 Sep 2023 01:00:00 +0200}, 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 = {Sat, 08 Jan 2022 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, 03 Nov 2020 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 = {Sat, 08 Jan 2022 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 = {Sat, 08 Jan 2022 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 = {Wed, 28 Feb 2024 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 = {Thu, 24 Feb 2022 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 = {Sat, 08 Jan 2022 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 = {Thu, 24 Feb 2022 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 = {Mon, 03 Jan 2022 00:00:00 +0100}, 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 = {Tue, 29 Dec 2020 00:00:00 +0100}, 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 = {Thu, 29 Apr 2021 01:00:00 +0200}, 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, 03 Nov 2020 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/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 = {Mon, 28 Aug 2023 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/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 = {Wed, 18 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/BabenkoGGN16.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, 29 Dec 2020 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/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 = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/EnglertRV16.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/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 = {Thu, 24 Feb 2022 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/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/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 = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/LubbeckeMMW16.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/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/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} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.