Takehiro Ito

CoRR, 2022

Invitation to Combinatorial Reconfiguration.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

Happy Set Problem on Subclasses of Co-comparability Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

Reconfiguration of Regular Induced Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

On Reachable Assignments Under Dichotomous Preferences.

[BibT_eX]

[DOI]

Proceedings of the PRIMA 2022: Principles and Practice of Multi-Agent Systems, 2022

Independent Set Reconfiguration on Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Sorting Balls and Water: Equivalence and Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Invitation to Combinatorial Reconfiguration (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

Reforming an Envy-Free Matching.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Reconfiguring Directed Trees in a Digraph.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Parameterized complexity of independent set reconfiguration problems.

[BibT_eX]

[DOI]

Marcin Jakub Kaminski

Discret. Appl. Math., 2020

Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Shortest Reconfiguration of Colorings Under Kempe Changes.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Fixed-Parameter Algorithms for Graph Constraint Logic.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Minimization and Parameterized Variants of Vertex Partition Problems on Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Reconfiguration of Spanning Trees with Many or Few Leaves.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Shortest Reconfiguration of Matchings.

[BibT_eX]

[DOI]

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

Reconfiguration of Minimum Steiner Trees via Vertex Exchanges.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

The Perfect Matching Reconfiguration Problem.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Incremental Optimization of Independent Sets Under the Reconfiguration Framework.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Diameter of Colorings Under Kempe Changes.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Algorithms for Gerrymandering over Graphs.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Complexity of Reconfiguration Problems for Constraint Satisfaction.

[BibT_eX]

[DOI]

CoRR, 2018

Incremental Optimization of Independent Sets under Reachability Constraints.

[BibT_eX]

[DOI]

CoRR, 2018

Reconfiguration of Colorable Sets in Classes of Perfect Graphs.

[BibT_eX]

[DOI]

Yota Otachi

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Algorithms for Coloring Reconfiguration Under Recolorability Constraints.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Reconfiguring Spanning and Induced Subgraphs.

[BibT_eX]

[DOI]

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

2017

Complexity of Tiling a Polygon with Trominoes or Bars.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

The Complexity of (List) Edge-Coloring Reconfiguration Problem.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2017

Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2017

Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Complexity of Coloring Reconfiguration under Recolorability Constraints.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Complexity of the Multi-Service Center Problem.

[BibT_eX]

[DOI]

Naonori Kakimura

Yusuke Kobayashi

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Reconfiguration of Maximum-Weight b-Matchings in a Graph.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

The Coloring Reconfiguration Problem on Specific Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

Tight Approximability of the Server Allocation Problem for Real-Time Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Cloud Computing - Third International Workshop, 2017

2016

The minimum vulnerability problem on specific graph classes.

[BibT_eX]

[DOI]

Yusuke Aoki

Bjarni V. Halldórsson

Magnús M. Halldórsson

Christian Konrad

J. Comb. Optim., 2016

Reconfiguration of Steiner Trees in an Unweighted Graph.

[BibT_eX]

[DOI]

Haruka Mizuta

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

Efficient Stabilization of Cooperative Matching Games.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Linear-time algorithm for sliding tokens on trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Algorithms for the Independent Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

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

Competitive Diffusion on Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

The Complexity of Dominating Set Reconfiguration.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Reconfiguration of Cliques in a Graph.

[BibT_eX]

[DOI]

Hirotaka Ono

Yota Otachi

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

2014

Reconfiguration of list L(2,1)-labelings in a graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Base-object location problems for base-monotone regions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

On the Parameterized Complexity for Token Jumping on Graphs.

[BibT_eX]

[DOI]

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

Deterministic Algorithms for the Independent Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Reconfiguration of Vertex Covers in a Graph.

[BibT_eX]

[DOI]

Hiroyuki Nooka

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Fixed-Parameter Tractability of Token Jumping on Planar Graphs.

[BibT_eX]

[DOI]

Marcin Jakub Kaminski

Hirotaka Ono

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Minimum-Cost b -Edge Dominating Sets on Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Polynomial-Time Algorithm for Sliding Tokens on Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Swapping Labeled Tokens on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2014

The Minimum Vulnerability Problem on Graphs.

[BibT_eX]

[DOI]

Yusuke Aoki

Bjarni V. Halldórsson

Magnús M. Halldórsson

Christian Konrad

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Generalized Rainbow Connectivity of Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Base Location Problems for Base-Monotone Regions.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

On the Minimum Caterpillar Problem in Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Partitioning a Weighted Tree into Subtrees with Weights in a Given Range.

[BibT_eX]

[DOI]

Algorithmica, 2012

A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Reconfiguration of List L(2, 1)-Labelings in a Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Laser Interferometric Measuring Method of Involute Artifact and Stabilization of Measurement.

[BibT_eX]

[DOI]

Int. J. Autom. Technol., 2011

On disconnected cuts and separators.

[BibT_eX]

[DOI]

Marcin Kaminski

Daniël Paulusma

Dimitrios M. Thilikos

Discret. Appl. Math., 2011

An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree.

[BibT_eX]

[DOI]

Kazuto Kawamura

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

Approximability of the Subset Sum Reconfiguration Problem.

[BibT_eX]

[DOI]

Erik D. Demaine

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

On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Minimum Cost Partitions of Trees with Supply and Demand.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009

A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2.

[BibT_eX]

[DOI]

W. Sean Kennedy

Bruce A. Reed

Electron. Notes Discret. Math., 2009

Reconfiguration of List Edge-Colorings in a Graph.

[BibT_eX]

[DOI]

Marcin Kaminski

Erik D. Demaine

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Route-Enabling Graph Orientation Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Parameterizing Cut Sets in a Graph by the Number of Their Components.

[BibT_eX]

[DOI]

Marcin Kaminski

Daniël Paulusma

Dimitrios M. Thilikos

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

On the Complexity of Reconfiguration Problems.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Erik D. Demaine

Nicholas J. A. Harvey

Martha Sideri

Ryuhei Uehara

Yushi Uno

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Partitioning Graphs of Supply and Demand.

[BibT_eX]

Proceedings of the Workshop on Algorithms and Computation 2007, 2007

2006

Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Approximability of Partitioning Graphs with Supply and Demand.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Partitioning graphs of supply and demand.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

Algorithms for Finding Distance-Edge-Colorings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.

[BibT_eX]

[DOI]

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

Implementation of the Extended Euclidean Algorithm for the Tate Pairing on FPGA.

[BibT_eX]

[DOI]

Yuichiro Shibata

Kiyoshi Oguri

Proceedings of the Field Programmable Logic and Application, 2004

2002

Partitioning Trees of Supply and Demand.

[BibT_eX]

[DOI]

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

Algorithms for the Multicolorings of Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

1997

On fault injection approaches for fault tolerance of feedforward neural networks.

[BibT_eX]

[DOI]