| Sublinear Computation Paradigm: Constant-Time Algorithms and Sublinear Progressive Algorithms | 0 | 0.34 | 2022 |
| Twenty Years of Progress of $$hbox {JCDCG}^3$$JCDCG3 | 0 | 0.34 | 2020 |
| Cookie Clicker. | 0 | 0.34 | 2020 |
| Hyperfiniteness of Real-World Networks | 0 | 0.34 | 2019 |
| Generalized Shogi, Chess, And Xiangqi Are Constant-Time Testable | 0 | 0.34 | 2019 |
| What Graph Properties Are Constant-Time Testable?: Dense Graphs, Sparse Graphs, and Complex Networks | 0 | 0.34 | 2019 |
| Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical Networks. | 0 | 0.34 | 2019 |
| Preface for the Special Issue on the Project “Foundation of Innovative Algorithms for Big Data” | 0 | 0.34 | 2019 |
| Energy Efficiency And Renewable Energy Management With Multi-State Power-Down Systems | 0 | 0.34 | 2019 |
| Bumpy pyramid folding | 1 | 0.40 | 2018 |
| A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments. | 1 | 0.35 | 2017 |
| Editor's Message for Special Issue of Discrete and Computational Geometry, Graphs, and Games. | 0 | 0.34 | 2017 |
| Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares. | 0 | 0.34 | 2017 |
| Transforming Graphs with the Same Graphic Sequence. | 1 | 0.37 | 2017 |
| A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. | 6 | 0.44 | 2016 |
| Single-Player and Two-Player Buttons & Scissors Games. | 0 | 0.34 | 2016 |
| Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). | 0 | 0.34 | 2015 |
| Generalized River Crossing Problems | 0 | 0.34 | 2015 |
| Folding a Paper Strip to Minimize Thickness. | 1 | 0.54 | 2014 |
| Discrete and Computational Geometry and Graphs - 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers | 0 | 0.34 | 2014 |
| Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs | 0 | 0.34 | 2013 |
| Cannibal Animal Games: a new variant of Tic-Tac-Toe. | 0 | 0.34 | 2013 |
| On computational complexity of graph inference from counting | 1 | 0.36 | 2013 |
| Helly Numbers of Polyominoes | 0 | 0.34 | 2013 |
| The complexity of the stamp folding problem | 1 | 0.43 | 2013 |
| Constant-Time approximation algorithms for the knapsack problem | 3 | 0.42 | 2012 |
| Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems. | 16 | 0.68 | 2012 |
| Constant-time algorithms for sparsity matroids | 6 | 0.53 | 2012 |
| Algorithms and complexity of generalized river crossing problems | 1 | 0.41 | 2012 |
| How to Generalize Janken - Rock-Paper-Scissors-King-Flea. | 0 | 0.34 | 2012 |
| Arrangements of n Points whose Incident-Line-Numbers are at most n/2 | 2 | 0.43 | 2011 |
| An online algorithm optimally self-tuning to congestion for power management problems | 0 | 0.34 | 2011 |
| Complexity of the stamp folding problem | 1 | 0.44 | 2011 |
| Testing outerplanarity of bounded degree graphs | 4 | 0.47 | 2010 |
| Query-Number Preserving Reductions And Linear Lower Bounds For Testing | 1 | 0.35 | 2010 |
| Making polygons by simple folds and one straight cut | 1 | 0.35 | 2010 |
| Testing k-edge-connectivity of digraphs. | 5 | 0.51 | 2010 |
| Multi-commodity source location problems and price of greed | 0 | 0.34 | 2009 |
| Maximum-cover source location problems with objective edge-connectivity three | 1 | 0.36 | 2009 |
| Enumeration of isolated cliques and pseudo-cliques | 18 | 0.93 | 2009 |
| An improved constant-time approximation algorithm for maximum~matchings | 25 | 1.03 | 2009 |
| Inferring Pedigree Graphs from Genetic Distances | 1 | 0.41 | 2008 |
| Property Testing on k-Vertex-Connectivity of Graphs | 10 | 0.66 | 2008 |
| Computational Geometry and Graph Theory: International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers | 23 | 3.13 | 2008 |
| Transforming Graphs with the Same Degree Sequence | 2 | 0.44 | 2007 |
| Semi-Distance Codes and Steiner Systems | 1 | 0.43 | 2007 |
| Winning Ways of Weighted Poset Games. | 0 | 0.34 | 2007 |
| Two equivalent measures on weighted hypergraphs | 0 | 0.34 | 2006 |
| Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three | 1 | 0.36 | 2006 |
| Special Section on Discrete Mathematics and Its Applications | 0 | 0.34 | 2006 |
