Information and Systems-Theoretical Foundations of Computing(Date:2013/12/13)

Presentation
表紙

,  

[Date]2013/12/13
[Paper #]
目次

,  

[Date]2013/12/13
[Paper #]
Reflections on a CFL decision problem "L(G)=Σ^<*?>"

Eiichi Tanaka,  

[Date]2013/12/13
[Paper #]COMP2013-38
Algorithms for Independent Set Reconfiguration Problem on Graphs

Erik D. DEMAINE,  Martin L. DEMAINE,  Takehiro ITO,  Hirotaka ONO,  Ryuhei UEHARA,  

[Date]2013/12/13
[Paper #]COMP2013-39
On Enumerating All Maximal Cliques in Unit Disk Graphs

Daisuke SUZUKI,  Taisuke IZUMI,  

[Date]2013/12/13
[Paper #]COMP2013-40
Localization of eigenvector centrality on single-defect networks

Hiroki YAMAGUCHI,  

[Date]2013/12/13
[Paper #]COMP2013-41
An empirical study for independent distance dominating sets in large-scale graphs

Hiroshi KADOWAKI,  Liang ZHAO,  Dorothea WAGNER,  

[Date]2013/12/13
[Paper #]COMP2013-42
On the Extension of the Serial Dictatorship with Project Closures

Naoyuki KAMIYAMA,  

[Date]2013/12/13
[Paper #]COMP2013-43
A Power Allocation Management System Using an Algorithm for the Knapsack Problem

Naoyuki MORIMOTO,  Yuu FUJITA,  Masaaki YOSHIDA,  HIroyuki YOSHIMIZU,  Masafumi TAKIYAMADA,  Terukazu AKEHI,  Masami TANAKA,  

[Date]2013/12/13
[Paper #]COMP2013-44
The Hidden K-matrix Linear Complementarity Problem is at Least as Hard as Linear Programming over Cubes

Jan FONIOK,  Komei FUKUDA,  Lorenz KLAUS,  

[Date]2013/12/13
[Paper #]COMP2013-45
Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions

Hiroki MORIZUMI,  

[Date]2013/12/13
[Paper #]COMP2013-46
Introduction to Computational Complexity Theory (5) : Approaches to P vs. NP via Boolean Circuits

Kazuhisa SETO,  

[Date]2013/12/13
[Paper #]COMP2013-47
An Adjustable Work Space Algorithm for Finding a Shortest Path in a Simple Polygon

Matsuo KONAGAYA,  Tetsuo ASANO,  Otfried CHEONG,  BAE Sang WON,  

[Date]2013/12/13
[Paper #]COMP2013-48
An Algorithm for Finding the Point Minimizing the Distance Error to Given Points

Shigeki NAKAMURA,  Tetsuo ASANO,  Siu-Wing CHENG,  

[Date]2013/12/13
[Paper #]COMP2013-49
Adjustable Work Space Algorithm of Arrangement of lines

Takahiro SEII,  Tetsuo ASANO,  

[Date]2013/12/13
[Paper #]COMP2013-50
Sublinear-time cake-cutting algorithms

Takahiro UEDA,  Hiro ITO,  

[Date]2013/12/13
[Paper #]COMP2013-51
Efficient Algorithms for Sorting k-Sets in Bins

Kazuhisa SETO,  Junichi TERUYAMA,  Atsuki NAGAO,  

[Date]2013/12/13
[Paper #]COMP2013-52
k-Edge-Rigid Body-Hinge Graphs

Yuya HIGASHIKAWA,  Naoki KATOH,  Yuki KOBAYASHI,  Adnan SLJOKA,  

[Date]2013/12/13
[Paper #]COMP2013-53
k-Sink Location Problem in Dynamic Path Networks

Yuya HIGASHIKAWA,  Mordecai. J GOLIN,  Naoki KATOH,  

[Date]2013/12/13
[Paper #]COMP2013-54
A New Automaton Construction using Prefixes and Suffixes of Regular Expressions

Hiroaki YAMAMOTO,  

[Date]2013/12/13
[Paper #]COMP2013-55
12>> 1-20hit(28hit)