Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/talg/talg16.bht:"
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 = {Mon, 03 Jan 2022 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, 02 Jan 2024 00:00:00 +0100},
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 = {Mon, 26 Oct 2020 00:00:00 +0100},
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 = {Mon, 28 Aug 2023 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 = {Sat, 30 Sep 2023 01:00:00 +0200},
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 = {Thu, 14 Oct 2021 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 = {Mon, 28 Aug 2023 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 = {Sun, 25 Jul 2021 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, 07 May 2024 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, 29 Dec 2020 00:00:00 +0100},
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, 30 Sep 2023 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 = {Sat, 08 Jan 2022 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 = {Sat, 08 Jan 2022 00:00:00 +0100},
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 = {Sat, 08 Jan 2022 00:00:00 +0100},
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 = {Sun, 12 Nov 2023 00:00:00 +0100},
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 = {Sat, 08 Jan 2022 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, 29 Dec 2020 00:00:00 +0100},
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 = {Sun, 02 Oct 2022 01:00:00 +0200},
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 = {Sat, 08 Jan 2022 00:00:00 +0100},
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 = {Sat, 08 Jan 2022 00:00:00 +0100},
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 = {Mon, 03 Jan 2022 00:00:00 +0100},
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 = {Sat, 08 Jan 2022 00:00:00 +0100},
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 = {Thu, 14 Oct 2021 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 = {Sat, 08 Jan 2022 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 = {Mon, 05 Feb 2024 00:00:00 +0100},
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 = {Mon, 26 Oct 2020 00:00:00 +0100},
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 = {Sat, 08 Jan 2022 00:00:00 +0100},
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 = {Sat, 09 Apr 2022 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 = {Sat, 08 Jan 2022 00:00:00 +0100},
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 = {Sat, 08 Jan 2022 00:00:00 +0100},
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 = {Mon, 05 Feb 2024 00:00:00 +0100},
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 = {Sat, 09 Apr 2022 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 = {Sat, 09 Apr 2022 01:00:00 +0200},
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 = {Mon, 28 Aug 2023 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 = {Sat, 08 Jan 2022 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 = {Sat, 08 Jan 2022 00:00:00 +0100},
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 = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/SteinZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-22 13:07 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
