|
|
|
|
|
|
|
|
|
|
An Approximation Algorithm for the 2-Dispersion Problem
Kazuyuki AMANO Shin-ichi NAKANO | Publication:
Publication Date: 2020/03/01
Vol. E103-D
No. 3
pp. 506-508
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science — Frontiers of Theory of Computation and Algorithm —)
Category:
Keyword:
dispersion problem, approximation algorithm, | | | Summary | Full Text:PDF | |
|
|
|
|
|
|
|
|
|
|
On r-Gatherings on the Line
Toshihiro AKAGI Shin-ichi NAKANO | Publication:
Publication Date: 2017/03/01
Vol. E100-D
No. 3
pp. 428-433
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Theoretical Computer Science —)
Category:
Keyword:
algorithm, facility location, | | | Summary | Full Text:PDF | |
|
Faster Min-Max r-Gatherings
Toshihiro AKAGI Ryota ARAI Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2016/06/01
Vol. E99-A
No. 6
pp. 1149-1151
Type of Manuscript:
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
facility location problem, | | | Summary | Full Text:PDF | |
|
|
|
|
Another Optimal Binary Representation of Mosaic Floorplans
Katsuhisa YAMANAKA Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/06/01
Vol. E98-A
No. 6
pp. 1223-1224
Type of Manuscript:
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
algorithm, coding, decoding, floorplan, mosaic floorplan, | | | Summary | Full Text:PDF | |
|
Efficient Enumeration of All Ladder Lotteries with k Bars
Katsuhisa YAMANAKA Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/06/01
Vol. E97-A
No. 6
pp. 1163-1170
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
algorithm, enumeration, ladder lottery, family tree, | | | Summary | Full Text:PDF | |
|
|
|
|
|
|
|
Listing All st-Orientations
Andry SETIAWAN Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2011/10/01
Vol. E94-A
No. 10
pp. 1965-1970
Type of Manuscript:
PAPER
Category: Algorithms and Data Structures
Keyword:
graph, st-orientation, enumeration, | | | Summary | Full Text:PDF | |
|
A Simple Canonical Code for Fullerene Graphs
Naoki SHIMOTSUMA Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/12/01
Vol. E92-A
No. 12
pp. 3398-3400
Type of Manuscript:
LETTER
Category: Algorithms and Data Structures
Keyword:
graph, algorithm, | | | Summary | Full Text:PDF | |
|
|
|
|
|
|
|
FOREWORD
Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/02/01
Vol. E90-D
No. 2
pp. 387-387
Type of Manuscript:
FOREWORD
Category:
Keyword:
| | | Summary | Full Text:PDF | |
|
|
|
|
Coding Floorplans with Fewer Bits
Katsuhisa YAMANAKA Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/05/01
Vol. E89-A
No. 5
pp. 1181-1185
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
graphs, algorithms, | | | Summary | Full Text:PDF | |
|
Generating All Series-Parallel Graphs
Shin-ichiro KAWANO Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/05/01
Vol. E88-A
No. 5
pp. 1129-1135
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
algorithm, enumeration, series-parallel graph, | | | Summary | Full Text:PDF | |
|
|
|
|
|
|
|
Efficient Generation of Plane Triangulations with Specified Maximum Degree
Hiroyuki TANAKA Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2004/02/01
Vol. E87-D
No. 2
pp. 330-336
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science)
Category:
Keyword:
graph, algorithm, plane graph, generation, | | | Summary | Full Text:PDF | |
|
|
|
|
|
|
|
Efficient Generation of Plane Triangulations with a Degree Constraint
Hiroyuki TANAKA Zhangjian LI Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/04/01
Vol. E86-A
No. 4
pp. 829-834
Type of Manuscript:
Special Section PAPER (Special Section of Selected Papers from the 15th Workshop on Circuits and Systems in Karuizawa)
Category:
Keyword:
graph, algorithm, plane graph, generation, | | | Summary | Full Text:PDF | |
|
|
|
|
FOREWORD
Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/05/01
Vol. E85-A
No. 5
pp. 921-921
Type of Manuscript:
FOREWORD
Category:
Keyword:
| | | Summary | Full Text:PDF | |
|
A Linear-Time Algorithm for Five-Partitioning Five-Connected Internally Triangulated Plane Graphs
Sayaka NAGAI Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/09/01
Vol. E84-A
No. 9
pp. 2330-2337
Type of Manuscript:
PAPER
Category: Algorithms and Data Structures
Keyword:
graph, algorithm, partition, | | | Summary | Full Text:PDF | |
|
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
Sayaka NAGAI Shin-ichi NAKANO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/05/01
Vol. E84-A
No. 5
pp. 1102-1109
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
graph, algorithm, independent spanning trees, | | | Summary | Full Text:PDF | |
|
|
|
|