Shin-Ichi Nakano

Discret. Appl. Math., January, 2024

Assigning Proximity Facilities for Gatherings.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2024

Dispersion in a Polygon.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

(t, s)-Completely Independent Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

A Gray Code of Ordered Trees.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2024

Enumerating Floorplans with Any Set of Columns.

[BibT_eX]

[DOI]

Yosuke Kikuchi

Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

2023

Family Trees for Enumeration.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., November, 2023

The Coverage Problem by Aligned Disks.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2023

Away from Each Other.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2023

Variants of Euclidean k-Center Clusterings.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

Dispersion on Intervals.

[BibT_eX]

[DOI]

Hiroyuki Miyata

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2022

Max-min dispersion on a line.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2022

r-Gatherings on a star and uncertain r-gatherings on a line.

[BibT_eX]

[DOI]

Shareef Ahmed

Discret. Math. Algorithms Appl., 2022

Escape from the Room.

[BibT_eX]

[DOI]

Kento Kimura

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Max-Min 3-Dispersion Problems.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

2020

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Krishnendu Mukhopadhyaya

J. Graph Algorithms Appl., 2020

Efficient Algorithms for the Partial Sum Dispersion Problem.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

An Approximation Algorithm for the 2-Dispersion Problem.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2020

Floorplans with Walls.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2020

2019

Sequentially Swapping Colored Tokens on Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

A Simple Algorithm for r-gatherings on the Line.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Enumerating Highly-Edge-Connected Spanning Subgraphs.

[BibT_eX]

[DOI]

Yasuko Matsui

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

r-Gatherings on a Star.

[BibT_eX]

[DOI]

Shareef Ahmed

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Simple Fold and Cut Problem for Line Segments.

[BibT_eX]

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

One-Dimensional r-Gathering Under Uncertainty.

[BibT_eX]

[DOI]

Shareef Ahmed

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

Enumerating Floorplans with Columns.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Exact Algorithms for the Max-Min Dispersion Problem.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

More Routes for Evacuation.

[BibT_eX]

[DOI]

Yasuko Matsui

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Away from Rivals.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Enumeration, Counting, and Random Generation of Ladder Lotteries.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2017

On r-Gatherings on the Line.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2017

Floorplans with Columns.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Tree Enumeration.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Geometric Object Enumeration.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Uniformly Random Generation of Floorplans.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2016

Faster Min-Max r-Gatherings.

[BibT_eX]

[DOI]

Ryota Arai

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

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

[BibT_eX]

[DOI]

Comput. Geom., 2016

2015

Anti-Slide.

[BibT_eX]

[DOI]

Koichi Yamazaki

J. Inf. Process., 2015

Another Optimal Binary Representation of Mosaic Floorplans.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

On r-Gatherings on the Line.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

2014

A 4.31-approximation for the geometric unique coverage problem on unit disks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Efficient Enumeration of All Ladder Lotteries with k Bars.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

2013

Efficient algorithms for a simple network design problem.

[BibT_eX]

[DOI]

Networks, 2013

Two Compact Codes for Rectangular Drawings with Degree Four Vertices.

[BibT_eX]

[DOI]

Masashi Saito

J. Inf. Process., 2013

Guest Editor's Foreword.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Takao Asano

Yoshio Okamoto

Int. J. Comput. Geom. Appl., 2013

A Compact Encoding of Rectangular Drawings with Edge Lengths.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2013

Guest Editorial: Selected Papers from ISAAC 2011.

[BibT_eX]

[DOI]

Takao Asano

Yoshio Okamoto

Algorithmica, 2013

2012

Efficient enumeration of ordered trees with k leaves.

[BibT_eX]

[DOI]

Yota Otachi

Theor. Comput. Sci., 2012

Enumerating All Rooted Trees Including k Leaves.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2012

2011

Generating All Triangulations of Plane Graphs.

[BibT_eX]

[DOI]

Mohammad Tanvir Parvez

J. Graph Algorithms Appl., 2011

Listing All st-Orientations.

[BibT_eX]

[DOI]

Andry Setiawan

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

A Compact Encoding of Unordered Binary Trees.

[BibT_eX]

[DOI]

Kozue Iwata

Shiro Ishiwata

Proceedings of the Theory and Applications of Models of Computation, 2011

2010

Efficient enumeration of all ladder lotteries and its application.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

A compact encoding of plane triangulations with efficient query supports.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

2009

Listing All Plane Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2009

A Simple Canonical Code for Fullerene Graphs.

[BibT_eX]

[DOI]

Naoki Shimotsuma

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).

[BibT_eX]

[DOI]

Yota Otachi

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Generating All Triangulations of Plane Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Mohammad Tanvir Parvez

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008

A Compact Encoding of Rectangular Drawings with Efficient Query Supports.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

2007

Constant Time Generation of Integer Partitions.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

Special Section on Foundations of Computer Science.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2007

Constant Time Generation of Linear Extensions.

[BibT_eX]

Akimitsu Ono

Proceedings of the Workshop on Algorithms and Computation 2007, 2007

Efficient Algorithms for Airline Problem.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

Convex Grid Drawings of Four-connected Plane Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

Constant Time Generation of Rectangular Drawings with Exactly n Faces.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Coding Floorplans with Fewer Bits.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

2005

Generating All Series-Parallel Graphs.

[BibT_eX]

[DOI]

Shin-ichiro Kawano

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Constant Time Generation of Set Partitions.

[BibT_eX]

[DOI]

Shin-ichiro Kawano

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Generating Colored Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004

Listing all rectangular drawings with certain properties.

[BibT_eX]

[DOI]

Masahiro Takagi

Syst. Comput. Jpn., 2004

Efficient Generation of Plane Triangulations with Specified Maximum Degree.

[BibT_eX]

[DOI]

Hiroyuki Tanaka

IEICE Trans. Inf. Syst., 2004

Efficient generation of triconnected plane triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Constant Time Generation of Trees with Specified Diameter.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003

Efficient Generation of Plane Triangulations with a Degree Constraint.

[BibT_eX]

[DOI]

Hiroyuki Tanaka

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Listing All Connected Plane Triangulations.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

More Efficient Generation of Plane Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Discovering Frequent Substructures in Large Unordered Trees.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 6th International Conference, 2003

How to Obtain the Complete List of Caterpillars (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Efficient generation of plane trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Labeling Points with Rectangles of Various Shapes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2002

Enumerating Floorplans with n Rooms.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

Foreword.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

Rectangular drawings of plane graphs without designated corners.

[BibT_eX]

[DOI]

Comput. Geom., 2002

2001

Grid Drawings of 4-Connected Plane Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Enumerating Floorplans with n Rooms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Efficient Generation of Plane Triangulations without Repetitions.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Listing all connected plane triangulation.

[BibT_eX]

[DOI]

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Box-Rectangular Drawings of Plane Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2000

A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs.

[BibT_eX]

[DOI]

Sayaka Nagai

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Convex Grid Drwaings of Four-Connected Plane Graphs.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Makiko Yoshikawa

Proceedings of the Graph Drawing, 8th International Symposium, 2000

Labeling Points with Rectangles of Various Shapes.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1999

A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1999

Grid Drawings of Four-Connected Plane Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

Rectangular grid drawings of plane graphs.

[BibT_eX]

[DOI]

Comput. Geom., 1998

Minimum-width grid drawings of plane graphs.

[BibT_eX]

[DOI]

Marek Chrobak

Comput. Geom., 1998

1997

A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

Edge-Coloring Partial k-Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1996

1995

Edge-Coloring Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994

A Parallel Algorithm for Edge-Coloring Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

1993

Scheduling File Transfers Under Port and Channe; Constraints.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

Nearly uniform scheduling of file transfers.

[BibT_eX]

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

A Linear Algorithm for Edge-Coloring Partial k-Trees.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the LATIN '92, 1992

1991

Scheduling File Transfers under Port and Channel Constraints.

[BibT_eX]

[DOI]

Proceedings of the ISA '91 Algorithms, 1991

1990

On the fg-coloring of graphs.

[BibT_eX]

[DOI]