Hiro Ito

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

Computational Complexity of Flattening Fixed-Angle Orthogonal Chains.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Turning Around and Around: Motion Planning through Thick and Thin Turnstiles.

[BibT_eX]

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

FUN editorial.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Editor's Message for Special Issue of Discrete and Computational Geometry, Graphs, and Games.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

K3 Edge Cover Problem in a Wide Sense.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Cookie Clicker.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Twenty Years of Progress of ${JCDCG}^3$.

[BibT_eX]

[DOI]

Graphs Comb., 2020

On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs.

[BibT_eX]

[DOI]

Areej Khoury

Ilan Newman

Comput. Complex., 2020

2019

Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data".

[BibT_eX]

[DOI]

Rev. Socionetwork Strateg., 2019

What Graph Properties Are Constant-Time Testable?

[BibT_eX]

[DOI]

Rev. Socionetwork Strateg., 2019

Hyperfiniteness of Real-World Networks.

[BibT_eX]

[DOI]

Rev. Socionetwork Strateg., 2019

Energy Efficiency and Renewable Energy Management with Multi-State Power-Down Systems.

[BibT_eX]

[DOI]

James Andro-Vasko

Wolfgang W. Bein

Inf., 2019

Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable.

[BibT_eX]

[DOI]

Atsuki Nagao

Teagun Park

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

On the Characterization of 1-sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix.

[BibT_eX]

[DOI]

Areej Khoury

Ilan Newman

CoRR, 2019

Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical Networks.

[BibT_eX]

[DOI]

Yuto Kishi

Nattapong Kitsuwan

Bijoy Chand Chatterjee

Eiji Oki

IEEE Access, 2019

2018

Bumpy pyramid folding.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Transforming Graphs with the Same Graphic Sequence.

[BibT_eX]

[DOI]

Sergey Bereg

J. Inf. Process., 2017

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

2016

Folding a paper strip to minimize thickness.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

Single-Player and Two-Player Buttons & Scissors Games.

[BibT_eX]

[DOI]

CoRR, 2016

How to Solve the Cake-Cutting Problem in Sublinear Time.

[BibT_eX]

[DOI]

Takahiro Ueda

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Every Property Is Testable on a Natural Class of Scale-Free Multigraphs.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Generalized River Crossing Problems.

[BibT_eX]

[DOI]

Stefan Langerman

Theory Comput. Syst., 2015

Editor's Message for Special Issue on Recreational Discrete Mathematics.

[BibT_eX]

[DOI]

J. Inf. Process., 2015

Cannibal Animal Games: a new variant of Tic-Tac-Toe.

[BibT_eX]

[DOI]

J. Inf. Process., 2015

Testing Outerplanarity of Bounded Degree Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2015

Number of Ties and Undefeated Signs in a Generalized Janken.

[BibT_eX]

[DOI]

Yoshinao Shiono

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Evaluation of Online Power-Down Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Information Technology, 2015

2013

The complexity of the stamp folding problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

On computational complexity of graph inference from counting.

[BibT_eX]

[DOI]

Szilárd Zsolt Fazekas

Nat. Comput., 2013

Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs.

[BibT_eX]

[DOI]

Mitsuru Kusumoto

Int. J. Netw. Comput., 2013

Helly Numbers of Polyominoes.

[BibT_eX]

[DOI]

Graphs Comb., 2013

2012

Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems.

[BibT_eX]

[DOI]

Masaki Yamamoto

SIAM J. Comput., 2012

Property Testing on k-Vertex-Connectivity of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2012

How to Generalize Janken - Rock-Paper-Scissors-King-Flea.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

Constant-Time Approximation Algorithms for the Knapsack Problem.

[BibT_eX]

[DOI]

Susumu Kiyoshima

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

Constant-Time Algorithms for Sparsity Matroids.

[BibT_eX]

[DOI]

Shin-ichi Tanigawa

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Algorithms and Complexity of Generalized River Crossing Problems.

[BibT_eX]

[DOI]

Stefan Langerman

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

Preface.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Arrangements of n Points whose Incident-Line-Numbers are at most n/2.

[BibT_eX]

[DOI]

Graphs Comb., 2011

An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems.

[BibT_eX]

[DOI]

Wolfgang W. Bein

Naoki Hatta

Nelson Hernandez-Cons

Shoji Kasahara

Jun Kawahara

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Complexity of the Stamp Folding Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Testing k-edge-connectivity of digraphs.

[BibT_eX]

[DOI]

J. Syst. Sci. Complex., 2010

Query-Number Preserving Reductions and Linear Lower Bounds for Testing.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2010

Making Polygons by Simple Folds and One Straight Cut.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009

Enumeration of isolated cliques and pseudo-cliques.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Maximum-cover source location problems with objective edge-connectivity three.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2009

The Multi-Commodity Source Location Problems and the Price of Greed.

[BibT_eX]

[DOI]

Mike Paterson

J. Graph Algorithms Appl., 2009

An improved constant-time approximation algorithm for maximum matchings.

[BibT_eX]

[DOI]

Masaki Yamamoto

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Inferring Pedigree Graphs from Genetic Distances.

[BibT_eX]

[DOI]

Takeyuki Tamura

IEICE Trans. Inf. Syst., 2008

2007

Winning Ways of Weighted Poset Games.

[BibT_eX]

[DOI]

Gisaku Nakamura

Satoshi Takata

Graphs Comb., 2007

Semi-Distance Codes and Steiner Systems.

[BibT_eX]

[DOI]

Midori Kobayashi

Gisaku Nakamura

Graphs Comb., 2007

Transforming Graphs with the Same Degree Sequence.

[BibT_eX]

[DOI]

Sergey Bereg

Proceedings of the Computational Geometry and Graph Theory, 2007

2006

Maximum-Cover Source-Location Problems.

[BibT_eX]

[DOI]

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

Efficient Methods for Determining DNA Probe Orders.

[BibT_eX]

[DOI]

Takeyuki Tamura

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

Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Preface.

[BibT_eX]

[DOI]

Naoki Katoh

Discret. Appl. Math., 2006

Two equivalent measures on weighted hypergraphs.

[BibT_eX]

[DOI]

Hiroshi Nagamochi

Discret. Appl. Math., 2006

2005

Single backup table schemes for shortest-path routing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Linear-Time Enumeration of Isolated Cliques.

[BibT_eX]

[DOI]

Tsuyoshi Osumi

Proceedings of the Algorithms, 2005

Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry, 2005

Infinite Series of Generalized Gosper Space Filling Curves.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry, 2005

2004

Subdivision of the hierarchy of H-colorable graph classes by circulant graphs.

[BibT_eX]

[DOI]

Akihiro Uejima

Electron. Notes Discret. Math., 2004

Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Imperfectness of Data for STS-Based Physical Mapping.

[BibT_eX]

[DOI]

Takeyuki Tamura

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

Source location problem with flow requirements in directed networks.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2003

Avoiding Routing Loops on the Internet.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2003

Foreword.

[BibT_eX]

[DOI]

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

Sum of edge lengths of a multigraph drawn on a convex polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Polynomial-Time Computable Backup Tables for Shortest-Path Routing.

[BibT_eX]

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

2002

Source location problems considering vertex-connectivity and edge-connectivity simultaneously.

[BibT_eX]

[DOI]

Networks, 2002

On H-Coloring Problems with H Expressed by Complements of Cycles, Bipartite Graphs, and Chordal Graphs.

[BibT_eX]

[DOI]

Akihiro Uejima

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

Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon.

[BibT_eX]

[DOI]

Hiroshi Nagamochi

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

File Transfer Tree Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Minimum cost source location problem with vertex-connectivity requirements in digraphs.

[BibT_eX]

[DOI]

Hiroshi Nagamochi

Toshimasa Ishii

Inf. Process. Lett., 2001

Lengths of tours and permutations on a vertex set of a convex polygon.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

Slot assignment scheme for integrated voice and data traffic in reservation-type packet radio networks.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE International Symposium on Personal, 2000

Sum of Edge Lengths of a Graph Drawn on a Convex Polygon.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1998

Edge connectivity between nodes and node-subsets.

[BibT_eX]

[DOI]

Networks, 1998

Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

NP-Completeness of Stage Illumination Problems.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1994

Network topology construction method and its support system.

[BibT_eX]

[DOI]

Takashi Satake