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/talg8.bht:"
download as .bib file
@article{DBLP:journals/talg/AgarwalCY12,
author = {Pankaj K. Agarwal and
Siu{-}Wing Cheng and
Ke Yi},
title = {Range searching on uncertain data},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {43:1--43:17},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344433},
doi = {10.1145/2344422.2344433},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/AgarwalCY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AndoniK12,
author = {Alexandr Andoni and
Robert Krauthgamer},
title = {The smoothed complexity of edit distance},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {44:1--44:25},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344434},
doi = {10.1145/2344422.2344434},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AndoniK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ArvindK12,
author = {Vikraman Arvind and
Piyush P. Kurur},
title = {Testing nilpotence of galois groups in polynomial time},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {32:1--32:22},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229176},
doi = {10.1145/2229163.2229176},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ArvindK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AsadpourFS12,
author = {Arash Asadpour and
Uriel Feige and
Amin Saberi},
title = {Santa claus meets hypergraph matchings},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {24:1--24:9},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229168},
doi = {10.1145/2229163.2229168},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AsadpourFS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AumannLMPY12,
author = {Yonatan Aumann and
Moshe Lewenstein and
Oren Melamud and
Ron Y. Pinter and
Zohar Yakhini},
title = {Dotted interval graphs},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {9:1--9:21},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151172},
doi = {10.1145/2151171.2151172},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/AumannLMPY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaptisteCD12,
author = {Philippe Baptiste and
Marek Chrobak and
Christoph D{\"{u}}rr},
title = {Polynomial-time algorithms for minimum energy scheduling},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {26:1--26:29},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229170},
doi = {10.1145/2229163.2229170},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BaptisteCD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BassinoCN12,
author = {Fr{\'{e}}d{\'{e}}rique Bassino and
Julien Cl{\'{e}}ment and
Pierre Nicod{\`{e}}me},
title = {Counting occurrences for a finite set of words: Combinatorial methods},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {31:1--31:28},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229175},
doi = {10.1145/2229163.2229175},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BassinoCN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaswanaKS12,
author = {Surender Baswana and
Sumeet Khurana and
Soumojit Sarkar},
title = {Fully dynamic randomized algorithms for graph spanners},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {35:1--35:51},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344425},
doi = {10.1145/2344422.2344425},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BaswanaKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BateniH12,
author = {MohammadHossein Bateni and
MohammadTaghi Hajiaghayi},
title = {Assignment problem in content distribution networks: Unsplittable
hard-capacitated facility location},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {20:1--20:19},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229164},
doi = {10.1145/2229163.2229164},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BateniH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Binkele-RaibleFFLSV12,
author = {Daniel Binkele{-}Raible and
Henning Fernau and
Fedor V. Fomin and
Daniel Lokshtanov and
Saket Saurabh and
Yngve Villanger},
title = {Kernel(s) for problems with no kernel: On out-trees with many leaves},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {38:1--38:19},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344428},
doi = {10.1145/2344422.2344428},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Binkele-RaibleFFLSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BjorklundHKK12,
author = {Andreas Bj{\"{o}}rklund and
Thore Husfeldt and
Petteri Kaski and
Mikko Koivisto},
title = {The traveling salesman problem in bounded degree graphs},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {18:1--18:13},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151181},
doi = {10.1145/2151171.2151181},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BjorklundHKK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BockerBT12,
author = {Sebastian B{\"{o}}cker and
Quang Bao Anh Bui and
Anke Tru{\ss}},
title = {Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {1},
pages = {7:1--7:17},
year = {2012},
url = {https://doi.org/10.1145/2071379.2071386},
doi = {10.1145/2071379.2071386},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BockerBT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BoseCHMM12,
author = {Prosenjit Bose and
Eric Y. Chen and
Meng He and
Anil Maheshwari and
Pat Morin},
title = {Succinct geometric indexes supporting point location queries},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {10:1--10:26},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151173},
doi = {10.1145/2151171.2151173},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BoseCHMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Chan12,
author = {Timothy M. Chan},
title = {All-pairs shortest paths for unweighted undirected graphs in \emph{o}(\emph{mn})
time},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {34:1--34:17},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344424},
doi = {10.1145/2344422.2344424},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Chan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriKP12,
author = {Chandra Chekuri and
Nitish Korula and
Martin P{\'{a}}l},
title = {Improved algorithms for orienteering and related problems},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {23:1--23:27},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229167},
doi = {10.1145/2229163.2229167},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChekuriKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChenLLSZ12,
author = {Jianer Chen and
Yang Liu and
Songjian Lu and
Sing{-}Hoi Sze and
Fenghui Zhang},
title = {Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {1},
pages = {6:1--6:22},
year = {2012},
url = {https://doi.org/10.1145/2071379.2071385},
doi = {10.1145/2071379.2071385},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChenLLSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChlebusKR12,
author = {Bogdan S. Chlebus and
Dariusz R. Kowalski and
Mariusz A. Rokicki},
title = {Adversarial Queuing on the Multiple Access Channel},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {1},
pages = {5:1--5:31},
year = {2012},
url = {https://doi.org/10.1145/2071379.2071384},
doi = {10.1145/2071379.2071384},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChlebusKR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ColletteDILM12,
author = {S{\'{e}}bastien Collette and
Vida Dujmovic and
John Iacono and
Stefan Langerman and
Pat Morin},
title = {Entropy, triangulation, and point location in planar subdivisions},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {29:1--29:18},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229173},
doi = {10.1145/2229163.2229173},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ColletteDILM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganP12,
author = {Marek Cygan and
Marcin Pilipczuk},
title = {Even Faster Exact Bandwidth},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {1},
pages = {8:1--8:14},
year = {2012},
url = {https://doi.org/10.1145/2071379.2071387},
doi = {10.1145/2071379.2071387},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/CyganP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CzyzowiczPL12,
author = {Jurek Czyzowicz and
Andrzej Pelc and
Arnaud Labourel},
title = {How to meet asynchronously (almost) everywhere},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {37:1--37:14},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344427},
doi = {10.1145/2344422.2344427},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CzyzowiczPL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DamerowMHRSST12,
author = {Valentina Damerow and
Bodo Manthey and
Friedhelm Meyer auf der Heide and
Harald R{\"{a}}cke and
Christian Scheideler and
Christian Sohler and
Till Tantau},
title = {Smoothed analysis of left-to-right maxima with applications},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {30:1--30:28},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229174},
doi = {10.1145/2229163.2229174},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DamerowMHRSST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineHMZ12,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Hamid Mahini and
Morteza Zadimoghaddam},
title = {The price of anarchy in network creation games},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {13:1--13:13},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151176},
doi = {10.1145/2151171.2151176},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DemaineHMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DeshpandeH12,
author = {Amol Deshpande and
Lisa Hellerstein},
title = {Parallel pipelined filter ordering with precedence constraints},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {41:1--41:38},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344431},
doi = {10.1145/2344422.2344431},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DeshpandeH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DiedrichJPSS12,
author = {Florian Diedrich and
Klaus Jansen and
Lars Pr{\"{a}}del and
Ulrich M. Schwarz and
Ola Svensson},
title = {Tight approximation algorithms for scheduling with fixed jobs and
nonavailability},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {27:1--27:15},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229171},
doi = {10.1145/2229163.2229171},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DiedrichJPSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DrmotaK12,
author = {Michael Drmota and
Reinhard Kutzelnigg},
title = {A precise analysis of Cuckoo hashing},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {11:1--11:36},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151174},
doi = {10.1145/2151171.2151174},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DrmotaK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EdmondsP12,
author = {Jeff Edmonds and
Kirk Pruhs},
title = {Scalably scheduling processes with arbitrary speedup curves},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {28:1--28:10},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229172},
doi = {10.1145/2229163.2229172},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/EdmondsP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FanelliFM12,
author = {Angelo Fanelli and
Michele Flammini and
Luca Moscardelli},
title = {The speed of convergence in congestion games under best-response dynamics},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {25:1--25:15},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229169},
doi = {10.1145/2229163.2229169},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/FanelliFM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FischerLMNY12,
author = {Eldar Fischer and
Oded Lachish and
Arie Matsliah and
Ilan Newman and
Orly Yahalom},
title = {On the query complexity of testing orientations for being Eulerian},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {15:1--15:41},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151178},
doi = {10.1145/2151171.2151178},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/FischerLMNY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FrigoLPR12,
author = {Matteo Frigo and
Charles E. Leiserson and
Harald Prokop and
Sridhar Ramachandran},
title = {Cache-Oblivious Algorithms},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {1},
pages = {4:1--4:22},
year = {2012},
url = {https://doi.org/10.1145/2071379.2071383},
doi = {10.1145/2071379.2071383},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/FrigoLPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Fujito12,
author = {Toshihiro Fujito},
title = {How to trim a {MST:} {A} 2-Approximation algorithm for minimum cost-tree
cover},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {16:1--16:11},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151179},
doi = {10.1145/2151171.2151179},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Fujito12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GuhaM12,
author = {Sudipto Guha and
Kamesh Munagala},
title = {Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization
Problems},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {1},
pages = {1:1--1:23},
year = {2012},
url = {https://doi.org/10.1145/2071379.2071380},
doi = {10.1145/2071379.2071380},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GuhaM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HaeuplerKMST12,
author = {Bernhard Haeupler and
Telikepalli Kavitha and
Rogers Mathew and
Siddhartha Sen and
Robert Endre Tarjan},
title = {Incremental Cycle Detection, Topological Ordering, and Strong Component
Maintenance},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {1},
pages = {3:1--3:33},
year = {2012},
url = {https://doi.org/10.1145/2071379.2071382},
doi = {10.1145/2071379.2071382},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/HaeuplerKMST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HeMS12,
author = {Meng He and
J. Ian Munro and
Srinivasa Rao Satti},
title = {Succinct ordinal trees based on tree covering},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {42:1--42:32},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344432},
doi = {10.1145/2344422.2344432},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/HeMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ImM12,
author = {Sungjin Im and
Benjamin Moseley},
title = {An online scalable algorithm for average flow time in broadcast scheduling},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {39:1--39:17},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344429},
doi = {10.1145/2344422.2344429},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ImM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KarakostasKW12,
author = {George Karakostas and
Stavros G. Kolliopoulos and
Jing Wang},
title = {An {FPTAS} for the minimum total weighted tardiness problem with a
fixed number of distinct due dates},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {40:1--40:16},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344430},
doi = {10.1145/2344422.2344430},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/KarakostasKW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KrokhinM12,
author = {Andrei A. Krokhin and
D{\'{a}}niel Marx},
title = {On the hardness of losing weight},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {19:1--19:18},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151182},
doi = {10.1145/2151171.2151182},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/KrokhinM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MahdianNS12,
author = {Mohammad Mahdian and
Hamid Nazerzadeh and
Amin Saberi},
title = {Online Optimization with Uncertain Information},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {1},
pages = {2:1--2:29},
year = {2012},
url = {https://doi.org/10.1145/2071379.2071381},
doi = {10.1145/2071379.2071381},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/MahdianNS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Manthey12,
author = {Bodo Manthey},
title = {On approximating multicriteria {TSP}},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {17:1--17:18},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151180},
doi = {10.1145/2151171.2151180},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Manthey12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MeyerZ12,
author = {Ulrich Meyer and
Norbert Zeh},
title = {I/O-efficient shortest path algorithms for undirected graphs with
random or bounded edge lengths},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {22:1--22:28},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229166},
doi = {10.1145/2229163.2229166},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/MeyerZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PanconesiR12,
author = {Alessandro Panconesi and
Jaikumar Radhakrishnan},
title = {Expansion properties of (secure) wireless networks},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {21:1--21:9},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229165},
doi = {10.1145/2229163.2229165},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/PanconesiR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RodittyZ12,
author = {Liam Roditty and
Uri Zwick},
title = {Replacement paths and \emph{k} simple shortest paths in unweighted
directed graphs},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {33:1--33:11},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344423},
doi = {10.1145/2344422.2344423},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/RodittyZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Swamy12,
author = {Chaitanya Swamy},
title = {The effectiveness of stackelberg strategies and tolls for network
congestion games},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {36:1--36:19},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344426},
doi = {10.1145/2344422.2344426},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Swamy12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/YeB12,
author = {Yuli Ye and
Allan Borodin},
title = {Elimination graphs},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {14:1--14:23},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151177},
doi = {10.1145/2151171.2151177},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/YeB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/YiZ12,
author = {Ke Yi and
Qin Zhang},
title = {Multidimensional online tracking},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {12:1--12:16},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151175},
doi = {10.1145/2151171.2151175},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/YiZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-24 09:30 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:
