Takehiro Ito

Hirotaka Ono

Yota Otachi

Discret. Appl. Math., July, 2023

Fixed-parameter algorithms for graph constraint logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., May, 2023

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, January, 2023

Reconfiguring (non-spanning) arborescences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Core Challenge 2023: Solver and Graph Descriptions.

[BibT_eX]

[DOI]

CoRR, 2023

Algorithmic Theory of Qubit Routing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Reconfiguration of Time-Respecting Arborescences.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Tools with Artificial Intelligence, 2023

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Rerouting Planar Curves and Disjoint Paths.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

Reconfiguration of Colorings in Triangulations of the Sphere.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

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

[BibT_eX]

[DOI]

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

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

A parameterized view to the robust recoverable base problem of matroids under structural uncertainty.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2022

Incremental optimization of independent sets under the reconfiguration framework.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Core Challenge 2022: Solver and Graph Descriptions.

[BibT_eX]

[DOI]

Takehide Soh

Yoshio Okamoto

CoRR, 2022

Invitation to Combinatorial Reconfiguration.

[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

Independent Set Reconfiguration on Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 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

Approximability of the independent feedback vertex set problem for bipartite graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Algorithms for gerrymandering over graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Reconfiguring Directed Trees in a Digraph.

[BibT_eX]

[DOI]

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

2020

Complexity of the multi-service center problem.

[BibT_eX]

[DOI]

Naonori Kakimura

Yusuke Kobayashi

Theor. Comput. Sci., 2020

Reconfiguring spanning and induced subgraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Diameter of colorings under Kempe changes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Parameterized complexity of independent set reconfiguration problems.

[BibT_eX]

[DOI]

Marcin Jakub Kaminski

Discret. Appl. Math., 2020

Shortest Reconfiguration of Colorings Under Kempe Changes.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 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

Reconfiguration of colorable sets in classes of perfect graphs.

[BibT_eX]

[DOI]

Yota Otachi

Theor. Comput. Sci., 2019

Reconfiguration of maximum-weight b-matchings in a graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

The Coloring Reconfiguration Problem on Specific Graph Classes.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2019

Minimum-Cost b-Edge Dominating Sets on Trees.

[BibT_eX]

[DOI]

Algorithmica, 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

2018

Parameterized complexity of the list coloring reconfiguration problem with graph parameters.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

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

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 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

Algorithms for Coloring Reconfiguration Under Recolorability Constraints.

[BibT_eX]

[DOI]

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

2017

Efficient stabilization of cooperative matching games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Reconfiguration of Steiner Trees in an Unweighted Graph.

[BibT_eX]

[DOI]

Haruka Mizuta

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

Complexity of Tiling a Polygon with Trominoes or Bars.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

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

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2017

Complexity of Coloring Reconfiguration under Recolorability Constraints.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 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 complexity of dominating set reconfiguration.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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 Vertex Covers in a Graph.

[BibT_eX]

[DOI]

Hiroyuki Nooka

IEICE Trans. Inf. Syst., 2016

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

[BibT_eX]

[DOI]

Comput. Geom., 2016

2015

Swapping labeled tokens on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs.

[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

2014

Generalized rainbow connectivity of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Complexity of finding maximum regular induced subgraphs with prescribed degree.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Approximability of the subset sum reconfiguration problem.

[BibT_eX]

[DOI]

Erik D. Demaine

J. Comb. Optim., 2014

On the Minimum Caterpillar Problem in Digraphs.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. 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

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

Polynomial-Time Algorithm for Sliding Tokens on Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 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

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

[BibT_eX]

[DOI]

Algorithmica, 2013

Route-Enabling Graph Orientation Problems.

[BibT_eX]

[DOI]

Algorithmica, 2013

Base Location Problems for Base-Monotone Regions.

[BibT_eX]

[DOI]

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

2012

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

[BibT_eX]

[DOI]

Kazuto Kawamura

IEICE Trans. Inf. Syst., 2012

Reconfiguration of list edge-colorings in a graph.

[BibT_eX]

[DOI]

Marcin Kaminski

Erik D. Demaine

Discret. Appl. Math., 2012

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

[BibT_eX]

[DOI]

Algorithmica, 2012

Minimum Cost Partitions of Trees with Supply and Demand.

[BibT_eX]

[DOI]

Algorithmica, 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

Parameterizing cut sets in a graph by the number of their components.

[BibT_eX]

[DOI]

Marcin Kaminski

Daniël Paulusma

Dimitrios M. Thilikos

Theor. Comput. Sci., 2011

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

Theor. Comput. Sci., 2011

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

[BibT_eX]

[DOI]

Int. J. Autom. Technol., 2011

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

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2011

On disconnected cuts and separators.

[BibT_eX]

[DOI]

Marcin Kaminski

Daniël Paulusma

Dimitrios M. Thilikos

Discret. Appl. Math., 2011

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

Partitioning graphs of supply and demand.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Approximability of partitioning graphs with supply and demand.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.

[BibT_eX]

[DOI]

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

2007

Algorithms for finding distance-edge-colorings of graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

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

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 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

2005

Partitioning trees of supply and demand.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 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

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]