default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 52
Volume 52, Number 1, July 2004
- Abraham Flaxman, Alan M. Frieze
, Eli Upfal:
Efficient communication in an ad-hoc network. 1-7 - Michael Elkin, Guy Kortsarz:
Logarithmic inapproximability of the radio broadcast problem. 8-25 - Jochen Alber, Henning Fernau, Rolf Niedermeier:
Parameterized complexity: exponential speed-up for planar graph problems. 26-56 - Matthew Andrews, Lisa Zhang:
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule. 57-81 - Biing-Feng Wang, Jyh-Jye Lin, Shan-Chyun Ku:
Efficient algorithms for the scaled indexing problem. 82-100
Volume 52, Number 2, August 2004
- Amr Elmasry:
Parameterized self-adjusting heaps. 103-119 - Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger:
All-norm approximation algorithms. 120-133 - Jochen Alber, Jirí Fiala:
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. 134-151 - John A. Ellis, Hongbing Fan, Michael R. Fellows:
The dominating set problem is fixed parameter tractable for graphs of bounded genus. 152-168 - Joan Boyar, Susan Krarup, Morten N. Nielsen:
Seat reservation allowing seat changes. 169-192 - Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To:
Performance guarantee for EDF under overload. 193-206
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 2025-01-04 01:05 CET 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:
