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/talg7.bht:"
download as .bib file
@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 = {Sun, 12 Nov 2023 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 = {Wed, 18 Aug 2021 01:00:00 +0200},
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 = {Sun, 02 Oct 2022 01:00:00 +0200},
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 = {Thu, 14 Oct 2021 01:00:00 +0200},
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 = {Fri, 07 May 2021 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 = {Fri, 01 Dec 2023 00:00:00 +0100},
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 = {Thu, 24 Mar 2022 00:00:00 +0100},
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, 21 Mar 2023 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 = {Sat, 05 Mar 2022 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 = {Wed, 28 Feb 2024 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/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/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 = {Mon, 28 Aug 2023 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/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/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/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 = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CookW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Djidjev10,
author = {Hristo N. 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 = {Wed, 14 Jul 2021 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/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/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 = {Mon, 26 Oct 2020 00:00:00 +0100},
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, 23 Jun 2023 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/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/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}
}
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-04-19 19:21 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:
