Shin-Ichi Nakano

According to our database1, Shin-Ichi Nakano authored at least 90 papers between 1990 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Sequentially Swapping Colored Tokens on Graphs.
J. Graph Algorithms Appl., 2019

A Simple Algorithm for r-gatherings on the Line.
J. Graph Algorithms Appl., 2019

Enumerating Highly-Edge-Connected Spanning Subgraphs.
IEICE Transactions, 2019

r-Gatherings on a Star.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Max-Min 3-Dispersion Problems.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

One-Dimensional r-Gathering Under Uncertainty.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
Enumerating Floorplans with Columns.
IEICE Transactions, 2018

Exact Algorithms for the Max-Min Dispersion Problem.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

More Routes for Evacuation.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Max-Min Dispersion on a Line.
Proceedings of the Combinatorial Optimization and Applications, 2018

Away from Rivals.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Enumeration, Counting, and Random Generation of Ladder Lotteries.
IEICE Transactions, 2017

On r-Gatherings on the Line.
IEICE Transactions, 2017

Floorplans with Columns.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Tree Enumeration.
Encyclopedia of Algorithms, 2016

Geometric Object Enumeration.
Encyclopedia of Algorithms, 2016

Uniformly Random Generation of Floorplans.
IEICE Transactions, 2016

Faster Min-Max r-Gatherings.
IEICE Transactions, 2016

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares.
Comput. Geom., 2016

Assigning Proximity Facilities for Gatherings.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Anti-Slide.
JIP, 2015

Another Optimal Binary Representation of Mosaic Floorplans.
IEICE Transactions, 2015

On r-Gatherings on the Line.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

2014
A 4.31-approximation for the geometric unique coverage problem on unit disks.
Theor. Comput. Sci., 2014

Efficient Enumeration of All Ladder Lotteries with k Bars.
IEICE Transactions, 2014

2013
Efficient algorithms for a simple network design problem.
Networks, 2013

Two Compact Codes for Rectangular Drawings with Degree Four Vertices.
JIP, 2013

Guest Editor's Foreword.
J. Graph Algorithms Appl., 2013

Guest Editors' Foreword.
Int. J. Comput. Geometry Appl., 2013

A Compact Encoding of Rectangular Drawings with Edge Lengths.
IEICE Transactions, 2013

Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.
Discrete Math., Alg. and Appl., 2013

Guest Editorial: Selected Papers from ISAAC 2011.
Algorithmica, 2013

2012
Efficient enumeration of ordered trees with k leaves.
Theor. Comput. Sci., 2012

Enumerating All Rooted Trees Including k Leaves.
IEICE Transactions, 2012

2011
Generating All Triangulations of Plane Graphs.
J. Graph Algorithms Appl., 2011

Listing All st-Orientations.
IEICE Transactions, 2011

A Compact Encoding of Unordered Binary Trees.
Proceedings of the Theory and Applications of Models of Computation, 2011

2010
Efficient enumeration of all ladder lotteries and its application.
Theor. Comput. Sci., 2010

A compact encoding of plane triangulations with efficient query supports.
Inf. Process. Lett., 2010

2009
Listing All Plane Graphs.
J. Graph Algorithms Appl., 2009

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.
J. Comput. Sci. Technol., 2009

A Simple Canonical Code for Fullerene Graphs.
IEICE Transactions, 2009

Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Generating All Triangulations of Plane Graphs (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008
A Compact Encoding of Rectangular Drawings with Efficient Query Supports.
IEICE Transactions, 2008

2007
Constant Time Generation of Integer Partitions.
IEICE Transactions, 2007

Special Section on Foundations of Computer Science.
IEICE Transactions, 2007

Constant Time Generation of Linear Extensions.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007

Efficient Algorithms for Airline Problem.
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
Convex Grid Drawings of Four-connected Plane Graphs.
Int. J. Found. Comput. Sci., 2006

Constant Time Generation of Rectangular Drawings with Exactly n Faces.
IEICE Transactions, 2006

Coding Floorplans with Fewer Bits.
IEICE Transactions, 2006

2005
Generating All Series-Parallel Graphs.
IEICE Transactions, 2005

Constant Time Generation of Set Partitions.
IEICE Transactions, 2005

Generating Colored Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004
Listing all rectangular drawings with certain properties.
Systems and Computers in Japan, 2004

Efficient Generation of Plane Triangulations with Specified Maximum Degree.
IEICE Transactions, 2004

Efficient generation of triconnected plane triangulations.
Comput. Geom., 2004

Constant Time Generation of Trees with Specified Diameter.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003
More Efficient Generation of Plane Triangulations.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Discovering Frequent Substructures in Large Unordered Trees.
Proceedings of the Discovery Science, 6th International Conference, 2003

How to Obtain the Complete List of Caterpillars (Extended Abstract).
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
Efficient generation of plane trees.
Inf. Process. Lett., 2002

Labeling Points with Rectangles of Various Shapes.
Int. J. Comput. Geometry Appl., 2002

Rectangular drawings of plane graphs without designated corners.
Comput. Geom., 2002

2001
Grid Drawings of 4-Connected Plane Graphs.
Discrete & Computational Geometry, 2001

Enumerating Floorplans with n Rooms.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Efficient Generation of Plane Triangulations without Repetitions.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Listing all connected plane triangulation.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Box-Rectangular Drawings of Plane Graphs.
J. Algorithms, 2000

A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Convex Grid Drwaings of Four-Connected Plane Graphs.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract).
Proceedings of the Graph Drawing, 8th International Symposium, 2000

Labeling Points with Rectangles of Various Shapes.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999
A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs.
J. Graph Algorithms Appl., 1999

A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs.
Int. J. Found. Comput. Sci., 1999

Grid Drawings of Four-Connected Plane Graphs.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998
Rectangular grid drawings of plane graphs.
Comput. Geom., 1998

Minimum-width grid drawings of plane graphs.
Comput. Geom., 1998

1997
A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs.
Inf. Process. Lett., 1997

A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996
Edge-Coloring Partial k-Trees.
J. Algorithms, 1996

1995
Edge-Coloring Algorithms.
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994
A Parallel Algorithm for Edge-Coloring Partial k-Trees.
Proceedings of the Algorithm Theory, 1994

1993
Scheduling File Transfers Under Port and Channe; Constraints.
Int. J. Found. Comput. Sci., 1993

Nearly uniform scheduling of file transfers.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

A Linear Algorithm for Edge-Coloring Partial k-Trees.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs.
Proceedings of the LATIN '92, 1992

1991
Scheduling File Transfers under Port and Channel Constraints.
Proceedings of the ISA '91 Algorithms, 1991

1990
On the fg-coloring of graphs.
Combinatorica, 1990


  Loading...