Information and Systems-Theoretical Foundations of Computing(Date:2007/05/18)

Presentation
表紙

,  

[Date]2007/5/18
[Paper #]
目次

,  

[Date]2007/5/18
[Paper #]
On Approximation of Bookmark Assignments

Yuichi ASAHIRO,  Eiji MIYANO,  Hirotaka ONO,  Toshihide MURATA,  

[Date]2007/5/18
[Paper #]COMP2007-11
On noise-reduction effect of filters for Boolean functions

EijiMasashi KARASAKI,  Eiji TAKIMOTO,  

[Date]2007/5/18
[Paper #]COMP2007-12
An O(1.787^n)-time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes

Takeyuki TAMURA,  Tatsuya AKUTSU,  

[Date]2007/5/18
[Paper #]COMP2007-13
Optimal Highway Location Problem

Matias KORMAN,  Takeshi TOKUYAMA,  

[Date]2007/5/18
[Paper #]COMP2007-14
Fixed-Parameter Tractability for Non-Crossing Spanning Trees

Magnus M. HALLDORSSON,  Christian KNAUER,  Andreas SPILLNER,  Takeshi TOKUYAMA,  

[Date]2007/5/18
[Paper #]COMP2007-15
A dynamic programmming algorithm for computing automorphism groups of a given set of matrices

Seinosuke TODA,  

[Date]2007/5/18
[Paper #]COMP2007-16
Optimality and Algorithms for the Balanced Edge Cover Problem

Yuta HARADA,  Hirotaka ONO,  Kunihiko SADAKANE,  Masafumi YAMASHITA,  

[Date]2007/5/18
[Paper #]COMP2007-17
コンピューテーション研究専門委員会からのお知らせ

,  

[Date]2007/5/18
[Paper #]
複写される方へ

,  

[Date]2007/5/18
[Paper #]
奥付

,  

[Date]2007/5/18
[Paper #]