Information and Systems-Theoretical Foundations of Computing(Date:2001/10/12)

Presentation
表紙

,  

[Date]2001/10/12
[Paper #]
目次

,  

[Date]2001/10/12
[Paper #]
Efficient Algorithms for the Weighted Coloring of Series-Parallel Graphs

Xiao ZHOU,  Takao NISHIZEKI,  

[Date]2001/10/12
[Paper #]COMP 2001-37
Algorithm for the List Edge-Coloring of Series-Parallel Graphs

Tomoya FUJINO,  Xiao ZHOU,  Takao NISHIZEKI,  

[Date]2001/10/12
[Paper #]COMP 2001-38
Inferring Rooted Evolutionary Trees from Lowest Common Ancestor Constraints

Leszek GASIENIEC,  Jesper JANSSON,  Andrzej LINGAS,  Anna OSTLIN,  

[Date]2001/10/12
[Paper #]COMP 2001-39
How to color a checkerboard with a given distribution Matrix rounding achieving low 2 × 2 discrepancy

Tetsuo ASANO,  Takeshi TOKUYAMA,  

[Date]2001/10/12
[Paper #]COMP 2001-40
Implementation of Digital Halftoning Algorithm based on Network Flow Problem

Koji OBOKATA,  

[Date]2001/10/12
[Paper #]COMP 2001-41
Planar Reconfiguration of Monotone Trees

Yoshiyuki KUSAKARI,  Masaki SATO,  Takao NISHIZEKI,  

[Date]2001/10/12
[Paper #]COMP 2001-42
A Self-Stabilizing Algorithm for Agent Traversal on Tree Networks

Yoshihiro NAKAMINAMI,  Toshimitsu MASUZAWA,  Ted HERMAN,  

[Date]2001/10/12
[Paper #]COMP 2001-43
Design and Evaluation of a Demand-Bus Scheduler based on the Coupon Collection Method

Akihiko NAKATANI,  Satoshi FUJITA,  

[Date]2001/10/12
[Paper #]COMP 2001-44
A Simplification of the Bakery algorithm Based on Bounded Tickets for the Mutual Exclusion Problem

Masataka TAKAMURA,  Yoshihide IGARASHI,  

[Date]2001/10/12
[Paper #]COMP 2001-45
On the Minimum Local-Vertex-Connectivity Augmentation in Graphs

Hiroshi NAGAMOCHI,  Toshimasa ISHII,  

[Date]2001/10/12
[Paper #]COMP 2001-46
On the factorization of generalized de Bruijn digraphs

Yosuke Kikuchi,  Yukio Shibata,  

[Date]2001/10/12
[Paper #]COMP 2001-47
Motif Search Algorithm and Its Applications for Gene Finding

Tetsuo Shibuya,  Isidore Rigoutsos,  

[Date]2001/10/12
[Paper #]COMP 2001-48
Membership of words in Codes

Tetsuo MORIYA,  

[Date]2001/10/12
[Paper #]COMP 2001-49
Efficient branch-and-bound algorithms for finding a maximum clique

Tomokazu SEKI,  Etsuji TOMITA,  

[Date]2001/10/12
[Paper #]COMP 2001-50
On the Computational Power of a Family of Decision Forests

Kazuyuki Amano,  Tsukuru Hirosawa,  Yusuke Watanabe,  Akira Maruoka,  

[Date]2001/10/12
[Paper #]COMP 2001-51
[OTHERS]

,  

[Date]2001/10/12
[Paper #]