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/talg2.bht:"
download as .bib file
@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 = {Sat, 30 Sep 2023 01:00:00 +0200},
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, 21 Mar 2023 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 L. 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 = {Wed, 02 Dec 2020 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 = {Sun, 02 Oct 2022 01:00:00 +0200},
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 = {Thu, 23 Jun 2022 01:00:00 +0200},
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 = {Mon, 03 Jan 2022 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, 14 Feb 2023 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}
}
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-25 17:14 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:
