Information and Systems-Theoretical Foundations of Computing(Date:2005/04/11)

Presentation
表紙

,  

[Date]2005/4/11
[Paper #]
目次

,  

[Date]2005/4/11
[Paper #]
A fast algorithm for calculating an upper bound of the weight of the maximum weighted clique

Kazuaki YAMAGUCHI,  Sumio MASUDA,  

[Date]2005/4/11
[Paper #]COMP2005-1
Exact Algorithms for Two-Dimensional Strip Packing Problems

Mitsutoshi KENMOCHI,  Takashi IMAMICHI,  Koji NONOBE,  Mutsunori YAGIURA,  Hiroshi NAGAMOCHI,  

[Date]2005/4/11
[Paper #]COMP2005-2
Branch-and-Bound Algorithms for MAX-2-SAT

Yuichi KOGA,  Koji NONOBE,  Mutsunori YAGIURA,  Hiroshi NAGAMOCHI,  Toshihide IBARAKI,  

[Date]2005/4/11
[Paper #]COMP2005-3
On time and space complexity of functions

Kenya UENO,  

[Date]2005/4/11
[Paper #]COMP2005-4
Quantum Algorithms for the Hidden Subgroup Problem over Semidirect Product Groups of Cyclic Groups

Yoshifumi INUI,  GALL Francois LE,  

[Date]2005/4/11
[Paper #]COMP2005-5
Truthful Auctions with Limited Ranges of Bids

Daisuke SUMITA,  Takashi HORIYAMA,  Kazuo IWAMA,  

[Date]2005/4/11
[Paper #]COMP2005-6
On the Complexity of Inferring a Graph from Path Frequency

Tatsuya AKUTSU,  Daiji FUKAGAWA,  

[Date]2005/4/11
[Paper #]COMP2005-7
Lowering Eccentricity of a Tree by Node-Upgrading

Toshihide IBARAKI,  Xiao-guang YANG,  

[Date]2005/4/11
[Paper #]COMP2005-8
複写される方へ

,  

[Date]2005/4/11
[Paper #]
Notice about Photocopying

,  

[Date]2005/4/11
[Paper #]
奥付

,  

[Date]2005/4/11
[Paper #]