| Discrete and Computational Geometry, Graphs, and Games - 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers | 0 | 0.34 | 2021 |
| Linear-Time Recognition of Double-Threshold Graphs | 0 | 0.34 | 2020 |
| Twenty Years of Progress of $$hbox {JCDCG}^3$$JCDCG3 | 0 | 0.34 | 2020 |
| Gourds: a sliding-block puzzle with turning | 0 | 0.34 | 2020 |
| Preface for the Special Issue on the Project “Foundation of Innovative Algorithms for Big Data” | 0 | 0.34 | 2019 |
| Reconfiguring Undirected Paths. | 0 | 0.34 | 2019 |
| Swapping Colored Tokens on Graphs. | 2 | 0.37 | 2018 |
| Settlement fund circulation problem | 0 | 0.34 | 2017 |
| Symmetric assembly puzzles are hard, beyond a few pieces | 0 | 0.34 | 2017 |
| Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. | 3 | 0.46 | 2016 |
| Single-Player and Two-Player Buttons & Scissors Games. | 0 | 0.34 | 2016 |
| Threes!, Fives, 1024!, and 2048 are Hard | 0 | 0.34 | 2015 |
| Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). | 0 | 0.34 | 2015 |
| Folding a Paper Strip to Minimize Thickness. | 1 | 0.54 | 2014 |
| Algorithmic aspects of distance constrained labeling: a survey. | 1 | 0.36 | 2014 |
| Approximating the path-distance-width for AT-free graphs and graphs in related classes. | 1 | 0.35 | 2014 |
| UNO Is Hard, Even for a Single Player | 7 | 0.93 | 2014 |
| Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set | 0 | 0.34 | 2014 |
| Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. | 0 | 0.34 | 2014 |
| (Total) Vector Domination for Graphs with Bounded Branchwidth. | 1 | 0.35 | 2014 |
| Morpion Solitaire 5D: a new upper bound of 121 on the maximum score. | 0 | 0.34 | 2013 |
| Contracted Webgraphs-Scale-Freeness And Structure Mining | 0 | 0.34 | 2013 |
| Computational Complexity And An Integer Programming Model Of Shakashaka | 2 | 0.39 | 2013 |
| Exact and fixed-parameter algorithms for metro-line crossing minimization problems. | 2 | 0.38 | 2013 |
| Contracted Webgraphs - Scale-Freeness and Structure Mining -. | 0 | 0.34 | 2013 |
| A 4.31-approximation for the geometric unique coverage problem on unit disks | 2 | 0.39 | 2012 |
| An Integer Programming Approach To Solving Tantrix On Fixed Boards | 1 | 0.38 | 2012 |
| Solving tantrix via integer programming | 0 | 0.34 | 2012 |
| Mining preserving structures in a graph sequence. | 5 | 0.42 | 2012 |
| On Complexity of Flooding Games on Graphs with Interval Representations | 2 | 0.42 | 2012 |
| The (p,q)-total labeling problem for trees | 1 | 0.36 | 2012 |
| A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares | 4 | 0.51 | 2012 |
| Contracted webgraphs: structure mining and scale-freeness | 0 | 0.34 | 2011 |
| Approximability of the path-distance-width for AT-free graphs | 2 | 0.39 | 2011 |
| The (2,1)-total labeling number of outerplanar graphs is at most Δ + 2 | 2 | 0.36 | 2010 |
| The complexity of UNO | 1 | 0.48 | 2010 |
| A new model for a scale-free hierarchical structure of isolated cliques | 1 | 0.42 | 2010 |
| An O(n1.75) algorithm for L(2,1)-labeling of trees | 6 | 0.45 | 2009 |
| A tight upper bound on the (2,1)-total labeling number of outerplanar graphs | 4 | 0.44 | 2009 |
| A Replacement Model for a Scale-Free Property of Cliques | 0 | 0.34 | 2009 |
| A Linear Time Algorithm for (2,1)-Labeling of Trees | 0 | 0.34 | 2009 |
| Laminar structure of ptolemaic graphs with applications | 7 | 0.57 | 2009 |
| An Algorithm for L(2, 1)-Labeling of Trees | 0 | 0.34 | 2008 |
| On the complexity of reconfiguration problems | 62 | 3.27 | 2008 |
| Computational Geometry and Graph Theory: International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers | 23 | 3.13 | 2008 |
| On Computing Longest Paths In Small Graph Classes | 26 | 1.07 | 2007 |
| Web Structure Mining by Isolated Cliques | 1 | 0.35 | 2007 |
| Web Structure Mining by Isolated Stars | 2 | 0.39 | 2006 |
| Minimum edge ranking spanning trees of split graphs | 1 | 0.36 | 2006 |
| Laminar structure of ptolemaic graphs and its applications | 6 | 0.49 | 2005 |
