@article{Yang-Wang/04,
AUTHOR = {Yang, Boting and Wang, Cao An},
TITLE = {Detecting tetrahedralizations of a set of line segments},
JOURNAL = {J. Algorithms},
VOLUME = {53},
NUMBER = {1},
PAGES = {1-35},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuths, Donald E.},
KEYWORDS = {computational geometry, tetrahedralization, $NP$-complete},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.04.006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Sun-Fernandez-Baca-Yu/04,
AUTHOR = {Sun, Fangting and Fern{\'a}ndez-Baca, David and Yu, Wei},
TITLE = {Inverse parametric sequence alignment},
JOURNAL = {J. Algorithms},
VOLUME = {53},
NUMBER = {1},
PAGES = {36-54},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {parametric analysis, inverse parametric analysis, global alignment, local alignment, sum-of-pairs multiple alignment, phylogenetic alignment, star alignment},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.04.008},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Gandhi-Khuller-Srinivasan/04,
AUTHOR = {Gandhi, Rajiv and Khuller, Samir and Srinivasan, Aravind},
TITLE = {Approximation algorithms for partial covering problems},
JOURNAL = {J. Algorithms},
VOLUME = {53},
NUMBER = {1},
PAGES = {55-84},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {approximation algorithms, partial covering, set cover, vertex cover, primal-dual methods, randomized rounding},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.04.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Gavoille-Peleg-Perennes-Raz/04,
AUTHOR = {Gavoille, Cyril and Peleg, David and P{\'e}rennes, St{\'e}phane and Raz, Ran},
TITLE = {Distance labeling in graphs},
JOURNAL = {J. Algorithms},
VOLUME = {53},
NUMBER = {1},
PAGES = {85-112},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.05.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Bender-Duan-Iacono-Wu/04,
AUTHOR = {Bender, Michael A. and Duan, Ziyang and Iacono, John and Wu, Jing},
TITLE = {A locality-preserving cache-oblivious dynamic dictionary},
JOURNAL = {J. Algorithms},
VOLUME = {53},
NUMBER = {2},
PAGES = {115-136},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.04.014},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Zhu/04,
AUTHOR = {Zhu, An},
TITLE = {Analysis of queueing policies in QoS switches},
JOURNAL = {J. Algorithms},
VOLUME = {53},
NUMBER = {2},
PAGES = {137-168},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.04.007},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Halperin-Livnat-Zwick/04,
AUTHOR = {Halperin, Eran and Livnat, Dror and Zwick, Uri},
TITLE = {MAX CUT in cubic graphs},
JOURNAL = {J. Algorithms},
VOLUME = {53},
NUMBER = {2},
PAGES = {169-185},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.06.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Arge-Brodal-Toma/04,
AUTHOR = {Arge, Lars and Brodal, Gerth St{\o}lting and Toma, Laura},
TITLE = {On external-memory MST, SSSP and multi-way planar graph separation},
JOURNAL = {J. Algorithms},
VOLUME = {53},
NUMBER = {2},
PAGES = {186-206},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.04.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Flaxman-Frieze-Upfal/04,
AUTHOR = {Flaxman, Abraham and Frieze, Alan and Upfal, Eli},
TITLE = {Efficient communication in an ad-hoc network},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {1},
PAGES = {1-7},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.01.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Elkin-Kortsarz/04,
AUTHOR = {Elkin, Michael and Kortsarz, Guy},
TITLE = {Logarithmic inapproximability of the radio broadcast problem},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {1},
PAGES = {8-25},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.11.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Alber-Fernau-Niedermeier/04,
AUTHOR = {Alber, Jochen and Fernau, Henning and Niedermeier, Rolf},
TITLE = {Parameterized complexity: Exponential speed-up for planar graph problems},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {1},
PAGES = {26-56},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {planar graph problems, fixed-parameter tractability, parameterized complexity, tree decomposition, graph separators},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.03.005},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Andrews-Zhang/04,
AUTHOR = {Andrews, Matthew and Zhang, Lisa},
TITLE = {Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {1},
PAGES = {57-81},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {packet routing, scheduling, earliest deadline first, weighted fair queueing, delay bounds},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.03.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Wang-Lin-Ku/04,
AUTHOR = {Wang, Biing-Feng and Lin, Jyh-Jye and Ku, Shan-Chyun},
TITLE = {Efficient algorithms for the scaled indexing problem},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {1},
PAGES = {82-100},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {string matching, approximate string matching, scaled matching, suffix trees, indexing},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.03.006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Elmasry/04a,
AUTHOR = {Elmasry, Amr},
TITLE = {Parameterized self-adjusting heaps},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {103-119},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.03.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Azar-Epstein-Richter-Woeginger/04,
AUTHOR = {Azar, Yossi and Epstein, Leah and Richter, Yossi and Woeginger, Gerhard J.},
TITLE = {All-norm approximation algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {120-133},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.02.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Alber-Fiala/04,
AUTHOR = {Alber, Jochen and Fiala, Ji{\v{r}}{\'{\i}}},
TITLE = {Geometric separation and exact solutions for the parameterized independent set problem on disk graphs},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {134-151},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {disk graphs, independent set, parameterized complexity, graph separators, graph measure},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.10.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Ellis-Fan-Fellows/04,
AUTHOR = {Ellis, J. and Fan, H. and Fellows, M.},
TITLE = {The dominating set problem is fixed parameter tractable for graphs of bounded genus},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {152-168},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {graph, genus, dominating set, fixed parameter algorithm},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.02.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Boyar-Krarup-Nielsen/04,
AUTHOR = {Boyar, Joan and Krarup, Susan and Nielsen, Morten N.},
TITLE = {Seat reservation allowing seat changes},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {169-192},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {seat reservation, on-line, accommodating sequences, restricted input sequences},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.02.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Lam-Ngan-To/04,
AUTHOR = {Lam, Tak-Wah and Ngan, Tsuen-Wan Johnny and To, Kar-Keung},
TITLE = {Performance guarantee for EDF under overload},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {193-206},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {online algorithms, extra-resource analysis, firm deadline scheduling, earliest deadline first},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.10.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Badger-Kearney-Li-Tsang-Jiang/04,
AUTHOR = {Badger, Jonathan and Kearney, Paul and Li, Ming and Tsang, John and Jiang, Tao},
TITLE = {Selecting the branches for an evolutionary tree: A polynomial time approximation scheme},
JOURNAL = {J. Algorithms},
VOLUME = {51},
NUMBER = {1},
PAGES = {1-14},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {approximation, character compatibility, evolution, phylogeny, ptas},
URL = {http://dx.doi.org/10.1016/S0196-6774(03)00086-5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Charron-Bost-Schiper/04,
AUTHOR = {Charron-Bost, Bernadette and Schiper, Andr{\'e}},
TITLE = {Uniform consensus is harder than consensus},
JOURNAL = {J. Algorithms},
VOLUME = {51},
NUMBER = {1},
PAGES = {15-37},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {distributed algorithm, synchronous model, failures, consensus, uniform consensus, time complexity, early deciding algorithms},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.11.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Diks-Fraigniaud-Kranakis-Pelc/04,
AUTHOR = {Diks, Krzysztof and Fraigniaud, Pierre and Kranakis, Evangelos and Pelc, Andrzej},
TITLE = {Tree exploration with little memory},
JOURNAL = {J. Algorithms},
VOLUME = {51},
NUMBER = {1},
PAGES = {38-63},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {graph exploration, universal traversal sequences},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.10.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Georgakopoulos/04,
AUTHOR = {Georgakopoulos, George F.},
TITLE = {Splay trees: A reweighing lemma and a proof of competitiveness vs. dynamic balanced trees},
JOURNAL = {J. Algorithms},
VOLUME = {51},
NUMBER = {1},
PAGES = {64-76},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.09.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Nikolopoulos-Palios/04a,
AUTHOR = {Nikolopoulos, Stavros D. and Palios, Leonidas},
TITLE = {Parallel algorithms for $P$-comparability graphs},
JOURNAL = {J. Algorithms},
VOLUME = {51},
NUMBER = {1},
PAGES = {77-104},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {parallel algorithms, perfectly orderable graphs, $P_4$-comparability graphs, $P_4$-components, recognition, acyclic $P_4$-transitive orientation, pram computation},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.11.005},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Wahlstrom/04,
AUTHOR = {Wahlstr{\"o}m, Magnus},
TITLE = {Exact algorithms for finding minimum transversals in rank-3 hypergraphs},
JOURNAL = {J. Algorithms},
VOLUME = {51},
NUMBER = {2},
PAGES = {107-121},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {minimum transversal, hypergraph, 3-hitting set, exact algorithm},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.01.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Pagh-Rodler/04,
AUTHOR = {Pagh, Rasmus and Rodler, Flemming Friche},
TITLE = {Cuckoo hashing},
JOURNAL = {J. Algorithms},
VOLUME = {51},
NUMBER = {2},
PAGES = {122-144},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {data structures, dictionaries, information retrieval, searching, hashing, experiments},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.12.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Bar-Noy-Malewicz/04,
AUTHOR = {Bar-Noy, Amotz and Malewicz, Grzegorz},
TITLE = {Establishing wireless conference calls under delay constraints},
JOURNAL = {J. Algorithms},
VOLUME = {51},
NUMBER = {2},
PAGES = {145-169},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {location management, conference call, np-hardness, approximation algorithms, convex optimization},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.11.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Panholzer-Prodinger-Riedel/04,
AUTHOR = {Panholzer, Alois and Prodinger, Helmut and Riedel, Marko},
TITLE = {Permuting in place: Analysis of two stopping rules},
JOURNAL = {J. Algorithms},
VOLUME = {51},
NUMBER = {2},
PAGES = {170-184},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {analysis of algorithms, permuting in place, knuth's parameter a, harmonic numbers},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.01.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Liberatore/04,
AUTHOR = {Liberatore, Vincenzo},
TITLE = {Circular arrangements and cyclic broadcast scheduling},
JOURNAL = {J. Algorithms},
VOLUME = {51},
NUMBER = {2},
PAGES = {185-215},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {approximation algorithms, combinatorial optimization, scheduling, broadcast disks, multicast},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.10.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Dumitrescu-Wu/04,
AUTHOR = {Dumitrescu, Sorina and Wu, Xiaolin},
TITLE = {Algorithms for optimal multi-resolution quantization},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {1},
PAGES = {1-22},
YEAR = {2004},
KEYWORDS = {Quantization, Multi-resolution signal representation, Multimedia communications, Convex Monge property, Matrix search, Dynamic programming},
URL = {DOI:10.1016/S0196-6774(03)00099-3},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Blaser/04,
AUTHOR = {Bl{\"a}ser, Markus},
TITLE = {An $\frac {8}{13}$-approximation algorithm for the asymmetric maximum TSP},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {1},
PAGES = {23-48},
YEAR = {2004},
URL = {DOI:10.1016/S0196-6774(03)00112-3},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Garg-Vazirani-Yannakakis/04,
AUTHOR = {Garg, Naveen and Vazirani, Vijay V. and Yannakakis, Mihalis},
TITLE = {Multiway cuts in node weighted graphs},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {1},
PAGES = {49-61},
YEAR = {2004},
URL = {DOI:10.1016/S0196-6774(03)00111-1},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Rahman-Nishizeki-Ghosh/04,
AUTHOR = {Rahman, Md. Saidur and Nishizeki, Takao and Ghosh, Shubhashis},
TITLE = {Rectangular drawings of planar graphs},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {1},
PAGES = {62-78},
YEAR = {2004},
KEYWORDS = {Planar graph, Algorithm, Graph drawing, Rectangular drawing},
URL = {DOI:10.1016/S0196-6774(03)00126-3},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Cowen-Wagner/04,
AUTHOR = {Cowen, Lenore J. and Wagner, Christopher G.},
TITLE = {Compact roundtrip routing in directed networks},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {1},
PAGES = {79-95},
YEAR = {2004},
URL = {DOI:10.1016/j.jalgor.2003.08.001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Han/04a,
AUTHOR = {Han, Yijie},
TITLE = {Deterministic sorting in $O(n log\log n)$ time and linear space},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {1},
PAGES = {96-105},
YEAR = {2004},
KEYWORDS = {Algorithms, Sorting, Integer sorting, Time complexity, Linear space},
URL = {DOI:10.1016/j.jalgor.2003.09.001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Jia-Zhang-Chen/04,
AUTHOR = {Jia, Weijia and Zhang, Chuanlin and Chen, Jianer},
TITLE = {An efficient parameterized algorithm for $m$-set packing},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {1},
PAGES = {106-117},
YEAR = {2004},
KEYWORDS = {Parameterized computation, Set packing, Exact algorithm, $NP$-hard problem},
URL = {DOI:10.1016/j.jalgor.2003.07.001},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Alon-Gutin-Krivelevich/04,
AUTHOR = {Alon, Noga and Gutin, Gregory and Krivelevich, Michael},
TITLE = {Algorithms with large domination ratio},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {1},
PAGES = {118-131},
YEAR = {2004},
KEYWORDS = {Combinatorial optimization, Domination analysis, Approximation algorithms},
URL = {DOI:10.1016/j.jalgor.2003.09.003},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Below-De_Loera-Richter-Gebert/04,
AUTHOR = {Below, Alexander and De Loera, Jes{\'u}s A. and Richter-Gebert, J{\"u}rgen},
TITLE = {The complexity of finding small triangulations of convex 3-polytopes},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {2},
PAGES = {134-167},
YEAR = {2004},
URL = {DOI:10.1016/S0196-6774(03)00092-0},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Evans-Kirkpatrick/04,
AUTHOR = {Evans, William and Kirkpatrick, David},
TITLE = {Restructuring ordered binary trees},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {2},
PAGES = {168-193},
YEAR = {2004},
URL = {DOI:10.1016/S0196-6774(03)00094-4},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Goemans-Skutella/04,
AUTHOR = {Goemans, Michel X. and Skutella, Martin},
TITLE = {Cooperative facility location games},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {2},
PAGES = {194-214},
YEAR = {2004},
KEYWORDS = {Facility location, Cooperative games, $LP$ relaxation, Randomized rounding, Core},
URL = {DOI:10.1016/S0196-6774(03)00098-1},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Babai-Pak/04,
AUTHOR = {Babai, L{\'a}szl{\'o} and Pak, Igor},
TITLE = {Strong bias of group generators: An obstacle to the ''product replacement algorithm''},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {2},
PAGES = {215-231},
YEAR = {2004},
URL = {DOI:10.1016/S0196-6774(03)00091-9},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Andrews/04,
AUTHOR = {Andrews, Matthew},
TITLE = {Instability of FIFO in session-oriented networks},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {2},
PAGES = {232-245},
YEAR = {2004},
URL = {DOI:10.1016/S0196-6774(03)00096-8},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Vishwanathan/04,
AUTHOR = {Vishwanathan, Sundar},
TITLE = {An approximation algorithm for finding long paths in Hamiltonian graphs},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {2},
PAGES = {246-256},
YEAR = {2004},
URL = {DOI:10.1016/S0196-6774(03)00093-2},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Amir-Lewenstein-Porat/04,
AUTHOR = {Amir, Amihood and Lewenstein, Moshe and Porat, Ely},
TITLE = {Faster algorithms for string matching with $k$ mismatches},
JOURNAL = {J. Algorithms},
VOLUME = {50},
NUMBER = {2},
PAGES = {257-275},
YEAR = {2004},
KEYWORDS = {Design and analysis of algorithms, Combinatorial algorithms on words, Approximate string matching, Hamming distance},
URL = {DOI:10.1016/S0196-6774(03)00097-X},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}