KOSEN 한인과학기술자네트워크

This Publication is Special Issue on Algorithm Engineering : Surveys *Invited Survey Papers 1. Algorithms for Submodular flows 2. Computing the Invariant Polynimials of Graphs, Network and Matroids 3. Algorithms in discrete convex analysis 4. The linear complementarity problem on oriented matroids 5. Combinatorics on arrangements and parametric matroids : A bridge between computational geometry and combinatorial optimization 6. recent development of graph connectivity augmentation algorithms 7. Planar drawings of plane graphs 8. Traversing Graphs in small space 9. The legal firing Sequence problem of petri nets 10. Graph coloring Algorithms 11. Effective use of geometric information for clusting and related topics 12. Structures of Triangulation of points 13. finding an Optimal Region in one-and two-dimensional arrays 14. How to make geometric algorithms robust 15. Approximation algorithms for geometric optimization problems 16. Designing High-Quality Approximation Algorithms for Combinatorial Optimaization problems 17. Approximation Algorithms for Submodular set Cover with Applications 18. Approximation algorithms for MAX SAT 19. Approximation Algorithms for Multiprocessors scheduling problem 20. The development of software components for solving the vehicle routing and facility location problems 21. Parallel algorithms for Convex Hull Problems and their Paradigm 22. Recent developments in Mesh Routing Algorithms 23. What structural Feature Make graph Problems to have Efficient parallel Algorithms? - Using outerplanar graphs, Trapezoid graphs and in-Tournament graphs as Examples- 24. Fault-Tolerance of Distributed Algorithms: self-Stabilization and wait-freedom 25. Secure Multi-party computaion over networks 26. A Progress Report on Lattice based Public-Key Cryptosystems - Theoretical Security versus Practical Cryptanalysis