default search action

combined dblp search
author search
venue search
publication search

ask others

Journal of Algorithms, Volume 45

> Home > Journals > Journal of Algorithms

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 45, Number 1, October 2002

- view
  authority control:
- export record
  dblp key:
  - journals/jal/JainMVW02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/JainMVW02
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
- view
  authority control:
- export record
  dblp key:
  - journals/jal/Aspnes02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Aspnes02
James Aspnes:
Fast deterministic consensus in a noisy environment. 16-39
- view
  authority control:
- export record
  dblp key:
  - journals/jal/KratochvilT02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/KratochvilT02
Jan Kratochvíl, Zsolt Tuza:
On the complexity of bicoloring clique hypergraphs of graphs. 40-54
- view
  authority control:
- export record
  dblp key:
  - journals/jal/Hsu02a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Hsu02a
Tsan-sheng Hsu:
Simpler and faster biconnectivity augmentation. 55-71
- view
  authority control:
- export record
  dblp key:
  - journals/jal/HalperinNZ02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/HalperinNZ02
Eran Halperin, Ram Nathaniel, Uri Zwick:
Coloring k-colorable graphs using relatively small palettes. 72-90

Volume 45, Number 2, November 2002

- view
  authority control:
- export record
  dblp key:
  - journals/jal/CapraraIMPS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/CapraraIMPS02
Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian Routing problem. 93-125
- view
  authority control:
- export record
  dblp key:
  - journals/jal/CarusoCMS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/CarusoCMS02
Antonio Caruso, Stefano Chessa, Piero Maestrini, Paolo Santi:
Diagnosability of regular systems. 126-143
- view
  authority control:
- export record
  dblp key:
  - journals/jal/Wood02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Wood02
David R. Wood:
Degree constrained book embeddings. 144-154
- view
  authority control:
- export record
  dblp key:
  - journals/jal/BrinkmannCH02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/BrinkmannCH02
Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen:
A constructive enumeration of fusenes and benzenoids. 155-166
- view
  authority control:
- export record
  dblp key:
  - journals/jal/JansenP02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/JansenP02
Klaus Jansen, Lorant Porkolab:
Polynomial time approximation schemes for general multiprocessor job shop scheduling. 167-191
- view
  authority control:
- export record
  dblp key:
  - journals/jal/FederM02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/FederM02
Tomás Feder, Rajeev Motwani:
Worst-case time bounds for coloring and satisfiability problems. 192-201
- view
  authority control:
- export record
  dblp key:
  - journals/jal/QueyranneS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/QueyranneS02
Maurice Queyranne, Maxim Sviridenko:
A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. 202-212

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.