Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 45
Volume 45, Number 1, October 2002
- Kamal Jain, Ion I. Mandoiu
, Vijay V. Vazirani, David P. Williamson:
A primal-dual schema based approximation algorithm for the element connectivity problem. 1-15 - James Aspnes:
Fast deterministic consensus in a noisy environment. 16-39 - Jan Kratochvíl, Zsolt Tuza:
On the complexity of bicoloring clique hypergraphs of graphs. 40-54 - Tsan-sheng Hsu:
Simpler and faster biconnectivity augmentation. 55-71 - Eran Halperin, Ram Nathaniel, Uri Zwick:
Coloring k-colorable graphs using relatively small palettes. 72-90
Volume 45, Number 2, November 2002
- Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian Routing problem. 93-125 - Antonio Caruso, Stefano Chessa, Piero Maestrini, Paolo Santi:
Diagnosability of regular systems. 126-143 - David R. Wood:
Degree constrained book embeddings. 144-154 - Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen:
A constructive enumeration of fusenes and benzenoids. 155-166 - Klaus Jansen, Lorant Porkolab:
Polynomial time approximation schemes for general multiprocessor job shop scheduling. 167-191 - Tomás Feder, Rajeev Motwani:
Worst-case time bounds for coloring and satisfiability problems. 192-201 - Maurice Queyranne, Maxim Sviridenko:
A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. 202-212
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-22 21:05 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:
