Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540638902, 9783540696629

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Airline crew-scheduling problem with many irregular flights

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-63890-3_2 ◽

1997 ◽

pp. 2-11 ◽

Cited By ~ 4

Author(s):

Akira Tajima ◽

Shinji Misono

Keyword(s):

Crew Scheduling ◽

Scheduling Problem ◽

Airline Crew Scheduling ◽

Airline Crew ◽

Crew Scheduling Problem

Download Full-text

Hard instance generation for SAT

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-63890-3_4 ◽

1997 ◽

pp. 22-31 ◽

Cited By ~ 10

Author(s):

Satoshi Horie ◽

Osamu Watanabe

Keyword(s):

Instance Generation

Download Full-text

Playing tetris on meshes and multi-dimensional Shearsort

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-63890-3_5 ◽

1997 ◽

pp. 32-41 ◽

Cited By ~ 1

Author(s):

Miroslaw Kutyłowski ◽

Rolf Wanka

Download Full-text

Generalized swap-with-parent schemes for self-organizing sequential linear lists

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-63890-3_44 ◽

1997 ◽

pp. 414-423 ◽

Cited By ~ 3

Author(s):

John Oommen ◽

Juan Dong

Keyword(s):

Linear Lists ◽

Self Organizing

Download Full-text

Competitive call control in mobile networks

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-63890-3_43 ◽

1997 ◽

pp. 404-413 ◽

Cited By ~ 2

Author(s):

Grammati E. Pantziou ◽

George P. Pentaris ◽

Paul G. Spirakis

Keyword(s):

Mobile Networks ◽

Call Control

Download Full-text

Homophonic coding with logarithmic memory size

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-63890-3_28 ◽

1997 ◽

pp. 253-262 ◽

Cited By ~ 2

Author(s):

Boris Ryabko ◽

Andrey Fionov

Keyword(s):

Memory Size

Download Full-text

On the size of probabilistic formulae

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-63890-3_27 ◽

1997 ◽

pp. 243-252 ◽

Cited By ~ 1

Author(s):

Hartmut Klauck

Download Full-text

Exponential lower bounds on the size of OBDDs representing integer division

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-63890-3_19 ◽

1997 ◽

pp. 163-172

Author(s):

Takashi Horiyama ◽

Shuzo Yajima

Keyword(s):

Lower Bounds ◽

Integer Division

Download Full-text

Singularities make spatial join scheduling hard

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-63890-3_32 ◽

1997 ◽

pp. 293-302 ◽

Cited By ~ 1

Author(s):

Gabriele Neyer ◽

Peter Widmayer

Keyword(s):

Spatial Join

Download Full-text

Practical approach to a facility location problem for large-scale logistics

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-63890-3_3 ◽

1997 ◽

pp. 12-21 ◽

Cited By ~ 1

Author(s):

Kazuyoshi Hidaka ◽

Hiroyuki Okano

Keyword(s):

Facility Location ◽

Large Scale ◽

Location Problem ◽

Facility Location Problem ◽

Practical Approach

Download Full-text

Algorithms and Computation - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Airline crew-scheduling problem with many irregular flights

Hard instance generation for SAT

Playing tetris on meshes and multi-dimensional Shearsort

Generalized swap-with-parent schemes for self-organizing sequential linear lists

Competitive call control in mobile networks

Homophonic coding with logarithmic memory size

On the size of probabilistic formulae

Exponential lower bounds on the size of OBDDs representing integer division

Singularities make spatial join scheduling hard

Practical approach to a facility location problem for large-scale logistics

Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications