Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 50
Volume 50, Number 1, January 2004
- Sorina Dumitrescu, Xiaolin Wu:
Algorithms for optimal multi-resolution quantization. 1-22 - Markus Bläser:
An 8/13-approximation algorithm for the asymmetric maximum TSP. 23-48 - Naveen Garg
, Vijay V. Vazirani, Mihalis Yannakakis:
Multiway cuts in node weighted graphs. 49-61 - Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh:
Rectangular drawings of planar graphs. 62-78 - Lenore Cowen, Christopher G. Wagner:
Compact roundtrip routing in directed networks. 79-95 - Yijie Han:
Deterministic sorting in O(nloglogn) time and linear space. 96-105 - Weijia Jia, Chuanlin Zhang, Jianer Chen:
An efficient parameterized algorithm for m-set packing. 106-117 - Noga Alon, Gregory Z. Gutin, Michael Krivelevich:
Algorithms with large domination ratio. 118-131
Volume 50, Number 2, February 2004
- David B. Shmoys:
Foreword. 133 - Alexander Below, Jesús A. De Loera, Jürgen Richter-Gebert:
The complexity of finding small triangulations of convex 3-polytopes. 134-167 - William S. Evans, David G. Kirkpatrick:
Restructuring ordered binary trees. 168-193 - Michel X. Goemans, Martin Skutella:
Cooperative facility location games. 194-214 - László Babai, Igor Pak:
Strong bias of group generators: an obstacle to the "product replacement algorithm". 215-231 - Matthew Andrews:
Instability of FIFO in session-oriented networks. 232-245 - Sundar Vishwanathan:
An approximation algorithm for finding long paths in Hamiltonian graphs. 246-256 - Amihood Amir, Moshe Lewenstein, Ely Porat:
Faster algorithms for string matching with k mismatches. 257-275
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.
last updated on 2024-04-25 05:27 CEST 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:
