Online ISSN : 

IEICE TRANSACTIONS on Information and Systems
Volume E83-D No.3  (Publication Date:2000/03/25)
Previous | 
Next
Special Issue on Algorithm Engineering: Surveys

pp.319-321  FOREWORD
FOREWORD
Toshihide IBARAKI  Masafumi YAMASHITA  
Summary | Full Text:PDF >>
Buy this Article


pp.322-329  INVITED SURVEY PAPER-Algorithms for Matroids and Related Discrete Systems
Algorithms for Submodular Flows
Satoru FUJISHIGE  Satoru IWATA  
Summary | Full Text:PDF >>
Buy this Article


pp.330-343  INVITED SURVEY PAPER-Algorithms for Matroids and Related Discrete Systems
Computing the Invariant Polynomials of Graphs, Networks and Matroids
Hiroshi IMAI  
Summary | Full Text:PDF >>
Buy this Article


pp.344-352  INVITED SURVEY PAPER-Algorithms for Matroids and Related Discrete Systems
Algorithms in Discrete Convex Analysis
Kazuo MUROTA  
Summary | Full Text:PDF >>
Buy this Article


pp.353-361  INVITED SURVEY PAPER-Algorithms for Matroids and Related Discrete Systems
The Linear Complementarity Problem on Oriented Matroids
Akihisa TAMURA  
Summary | Full Text:PDF >>
Buy this Article


pp.362-371  INVITED SURVEY PAPER-Algorithms for Matroids and Related Discrete Systems
Combinatorics on Arrangements and Parametric Matroids: A Bridge between Computational Geometry and Combinatorial Optimization
Takeshi TOKUYAMA  
Summary | Full Text:PDF >>
Buy this Article


pp.372-383  INVITED SURVEY PAPER-Graph Algorithms
Recent Development of Graph Connectivity Augmentation Algorithms
Hiroshi NAGAMOCHI  
Summary | Full Text:PDF >>
Buy this Article


pp.384-391  INVITED SURVEY PAPER-Graph Algorithms
Planar Drawings of Plane Graphs
Shin-ichi NAKANO  
Summary | Full Text:PDF >>
Buy this Article


pp.392-396  INVITED SURVEY PAPER-Graph Algorithms
Traversing Graphs in Small Space
Seinosuke TODA  
Summary | Full Text:PDF >>
Buy this Article


pp.397-406  INVITED SURVEY PAPER-Graph Algorithms
The Legal Firing Sequence Problem of Petri Nets
Toshimasa WATANABE  
Summary | Full Text:PDF >>
Buy this Article


pp.407-417  INVITED SURVEY PAPER-Graph Algorithms
Graph Coloring Algorithms
Xiao ZHOU  Takao NISHIZEKI  
Summary | Full Text:PDF >>
Buy this Article


pp.418-427  INVITED SURVEY PAPER-Algorithms for Geometric Problems
Effective Use of Geometric Information for Clustering and Related Topics
Tetsuo ASANO  
Summary | Full Text:PDF >>
Buy this Article


pp.428-437  INVITED SURVEY PAPER-Algorithms for Geometric Problems
Structures of Triangulations of Points
Keiko IMAI  
Summary | Full Text:PDF >>
Buy this Article


pp.438-446  INVITED SURVEY PAPER-Algorithms for Geometric Problems
Finding an Optimal Region in One- and Two-Dimensional Arrays
Naoki KATOH  
Summary | Full Text:PDF >>
Buy this Article


pp.447-454  INVITED SURVEY PAPER-Algorithms for Geometric Problems
How to Make Geometric Algorithms Robust
Kokichi SUGIHARA  
Summary | Full Text:PDF >>
Buy this Article


pp.455-461  INVITED SURVEY PAPER-Algorithms for Geometric Problems
Approximation Algorithms for Geometric Optimization Problems
Hisao TAMAKI  
Summary | Full Text:PDF >>
Buy this Article


pp.462-479  INVITED SURVEY PAPER-Approximate Algorithms for Combinatorial Problems
Designing High-Quality Approximation Algorithms for Combinatorial Optimization Problems
Takao ASANO  Kenichiro IWAMA  Hideyuki TAKADA  Yoshiko YAMASHITA  
Summary | Full Text:PDF >>
Buy this Article


pp.480-487  INVITED SURVEY PAPER-Approximate Algorithms for Combinatorial Problems
Approximation Algorithms for Submodular Set Cover with Applications
Toshihiro FUJITO  
Summary | Full Text:PDF >>
Buy this Article


pp.488-495  INVITED SURVEY PAPER-Approximate Algorithms for Combinatorial Problems
Approximation Algorithms for MAX SAT
Tomio HIRATA  Takao ONO  
Summary | Full Text:PDF >>
Buy this Article


pp.496-502  INVITED SURVEY PAPER-Approximate Algorithms for Combinatorial Problems
Approximation Algorithms for Scheduling Problems
Hiroaki ISHII  Minoru TADA  
Summary | Full Text:PDF >>
Buy this Article


pp.503-509  INVITED SURVEY PAPER-Approximate Algorithms for Combinatorial Problems
Approximation Algorithms for Multiprocessor Scheduling Problem
Satoshi FUJITA  Masafumi YAMASHITA  
Summary | Full Text:PDF >>
Buy this Article


pp.510-518  INVITED SURVEY PAPER-Approximate Algorithms for Combinatorial Problems
The Development of Software Components for Solving the Vehicle Routing and Facility Location Problems
Masahiko SHIMOMURA  Mikio KUDO  Hiroaki MOHRI  
Summary | Full Text:PDF >>
Buy this Article


pp.519-529  INVITED SURVEY PAPER-Parallel and Distributed Algorithms
Parallel Algorithms for Convex Hull Problems and Their Paradigm
Wei CHEN  Koji NAKANO  Koichi WADA  
Summary | Full Text:PDF >>
Buy this Article


pp.530-540  INVITED SURVEY PAPER-Parallel and Distributed Algorithms
Recent Developments in Mesh Routing Algorithms
Kazuo IWAMA  Eiji MIYANO  
Summary | Full Text:PDF >>
Buy this Article


pp.541-549  INVITED SURVEY PAPER-Parallel and Distributed Algorithms
What Structural Features Make Graph Problems to Have Efficient Parallel Algorithms? --Using Outerplanar Graphs, Trapezoid Graphs and In-Tournament Graphs as Examples--
Shigeru MASUYAMA  Shin-ichi NAKAYAMA  
Summary | Full Text:PDF >>
Buy this Article


pp.550-560  INVITED SURVEY PAPER-Parallel and Distributed Algorithms
Fault-Tolerance of Distributed Algorithms: Self-Stabilization and Wait-Freedom
Toshimitsu MASUZAWA  Michiko INOUE  
Summary | Full Text:PDF >>
Buy this Article


pp.561-569  INVITED SURVEY PAPER-Parallel and Distributed Algorithms
Secure Multi-Party Computation over Networks
Yasuaki NISHITANI  Yoshihide IGARASHI  
Summary | Full Text:PDF >>
Buy this Article


pp.570-579  INVITED SURVEY PAPER-Parallel and Distributed Algorithms
A Progress Report on Lattice Based Public-Key Cryptosystems -- Theoretical Security versus Practical Cryptanalysis --
Kouichi SAKURAI  
Summary | Full Text:PDF >>
Buy this Article


Previous | 
Next
go to Page Top