| Publication | Date of Publication | Type |
|---|
Independent set reconfiguration on directed graphs
SIAM Journal on Discrete Mathematics | 2026-04-21 | Paper |
Hardness of finding combinatorial shortest paths on graph associahedra
SIAM Journal on Discrete Mathematics | 2026-04-17 | Paper |
Reconfiguration of time-respecting arborescences
Algorithmica | 2025-12-30 | Paper |
Independent set reconfiguration under bounded-hop token jumping
Theoretical Computer Science | 2025-12-17 | Paper |
Rerouting planar curves and disjoint paths
ACM Transactions on Algorithms | 2025-07-22 | Paper |
| Algorithmic meta-theorems for combinatorial reconfiguration revisited | 2025-06-19 | Paper |
Reconfiguration of colorings in triangulations of the sphere
Journal of Computational Geometry | 2025-04-23 | Paper |
| Independent set reconfiguration under bounded-hop token jumping | 2025-04-15 | Paper |
Reforming an envy-free matching
Algorithmica | 2025-03-28 | Paper |
| Rerouting planar curves and disjoint paths | 2024-11-14 | Paper |
| Hardness of finding combinatorial shortest paths on graph associahedra | 2024-11-14 | Paper |
Reconfiguration of vertex-disjoint shortest paths on graphs
Journal of Graph Algorithms and Applications | 2024-11-12 | Paper |
Algorithmic meta-theorems for combinatorial reconfiguration revisited
Algorithmica | 2024-10-24 | Paper |
| Reconfiguration of colorings in triangulations of the sphere | 2024-10-16 | Paper |
| Independent set reconfiguration on directed graphs | 2024-08-06 | Paper |
| Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams | 2024-07-19 | Paper |
| Sorting balls and water: equivalence and computational complexity | 2024-05-16 | Paper |
| Invitation to combinatorial reconfiguration (invited talk) | 2024-05-06 | Paper |
| Reconfiguration of spanning trees with degree constraint or diameter constraint | 2024-04-23 | Paper |
Reconfiguration of time-respecting arborescences
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Algorithmic theory of qubit routing
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Reconfiguration of vertex-disjoint shortest paths on graphs
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Happy set problem on subclasses of co-comparability graphs
Algorithmica | 2023-11-17 | Paper |
| Minimization and parameterized variants of vertex partition problems on graphs | 2023-11-14 | Paper |
| Fixed-parameter algorithms for graph constraint logic | 2023-11-13 | Paper |
On reachable assignments under dichotomous preferences
Theoretical Computer Science | 2023-10-26 | Paper |
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Sorting balls and water: equivalence and computational complexity
Theoretical Computer Science | 2023-10-12 | Paper |
ZDD-based algorithmic framework for solving shortest reconfiguration problems
Integration of Constraint Programming, Artificial Intelligence, and Operations Research | 2023-10-04 | Paper |
Reconfiguration of spanning trees with degree constraints or diameter constraints
Algorithmica | 2023-09-27 | Paper |
Fixed-parameter algorithms for graph constraint logic
Theoretical Computer Science | 2023-05-12 | Paper |
| Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra | 2023-04-28 | Paper |
Reconfiguration of cliques in a graph
Discrete Applied Mathematics | 2023-04-27 | Paper |
| Reconfiguring directed trees in a digraph | 2023-03-30 | Paper |
| Shortest Reconfiguration of Colorings Under Kempe Changes | 2023-02-07 | Paper |
Reconfiguration of Spanning Trees with Many or Few Leaves
(available as arXiv preprint) | 2023-02-07 | Paper |
Reconfiguring (non-spanning) arborescences
Theoretical Computer Science | 2023-01-05 | Paper |
| Reconfiguration of colorings in triangulations of the sphere | 2022-10-31 | Paper |
| Rerouting Planar Curves and Disjoint Paths | 2022-10-21 | Paper |
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
Operations Research Letters | 2022-07-22 | Paper |
The Perfect Matching Reconfiguration Problem
(available as arXiv preprint) | 2022-07-21 | Paper |
| Algorithms for Coloring Reconfiguration Under Recolorability Constraints | 2022-07-21 | Paper |
| Reconfiguration of Minimum Steiner Trees via Vertex Exchanges | 2022-07-21 | Paper |
Incremental optimization of independent sets under the reconfiguration framework
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
| Invitation to combinatorial reconfiguration | 2022-07-13 | Paper |
Reconfiguration of regular induced subgraphs
(available as arXiv preprint) | 2022-07-13 | Paper |
| Happy set problem on subclasses of co-comparability graphs | 2022-07-13 | Paper |
| Reforming an Envy-Free Matching | 2022-07-06 | Paper |
scientific article; zbMATH DE number 7525498 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
Shortest reconfiguration of perfect matchings via alternating cycles
SIAM Journal on Discrete Mathematics | 2022-05-10 | Paper |
| Independent set reconfiguration on directed graphs | 2022-03-24 | Paper |
Algorithms for gerrymandering over graphs
Theoretical Computer Science | 2021-05-10 | Paper |
Approximability of the independent feedback vertex set problem for bipartite graphs
Theoretical Computer Science | 2020-12-15 | Paper |
| Complexity of coloring reconfiguration under recolorability constraints | 2020-11-25 | Paper |
| Complexity of the multi-service center problem | 2020-11-25 | Paper |
Complexity of the multi-service center problem
Theoretical Computer Science | 2020-10-12 | Paper |
Diameter of colorings under Kempe changes
Theoretical Computer Science | 2020-09-01 | Paper |
| Reconfiguration of Colorable Sets in Classes of Perfect Graphs | 2020-08-25 | Paper |
Approximability of the independent feedback vertex set problem for bipartite graphs
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
Parameterized complexity of independent set reconfiguration problems
Discrete Applied Mathematics | 2020-06-29 | Paper |
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
(available as arXiv preprint) | 2020-05-26 | Paper |
Shortest reconfiguration of matchings
(available as arXiv preprint) | 2020-02-24 | Paper |
Incremental optimization of independent sets under the reconfiguration framework
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Diameter of colorings under Kempe changes
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Reconfiguring spanning and induced subgraphs
Theoretical Computer Science | 2020-01-16 | Paper |
Reconfiguration of maximum-weight b-matchings in a graph
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
Reconfiguration of colorable sets in classes of perfect graphs
Theoretical Computer Science | 2019-05-17 | Paper |
Reconfiguration of colorable sets in classes of perfect graphs
Theoretical Computer Science | 2019-05-17 | Paper |
Minimum-cost b-edge dominating sets on trees
Algorithmica | 2019-01-11 | Paper |
Reconfiguring spanning and induced subgraphs
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Parameterized complexity of the list coloring reconfiguration problem with graph parameters
Theoretical Computer Science | 2018-06-18 | Paper |
| The coloring reconfiguration problem on specific graph classes | 2018-02-26 | Paper |
Complexity of tiling a polygon with trominoes or bars
Discrete & Computational Geometry | 2017-10-25 | Paper |
| Reconfiguration of maximum weight \(b\)-matchings in a graph | 2017-10-23 | Paper |
Efficient stabilization of cooperative matching games
Theoretical Computer Science | 2017-05-15 | Paper |
Approximation algorithm for the distance-3 independent set problem on cubic graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
The complexity of (list) edge-coloring reconfiguration problem
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
The complexity of dominating set reconfiguration
Theoretical Computer Science | 2017-03-16 | Paper |
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
The minimum vulnerability problem on specific graph classes
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
Reconfiguration of Steiner trees in an unweighted graph
Lecture Notes in Computer Science | 2016-09-29 | Paper |
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
Computational Geometry | 2016-01-18 | Paper |
The complexity of dominating set reconfiguration
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Competitive diffusion on weighted graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Reconfiguration of cliques in a graph
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Linear-time algorithm for sliding tokens on trees
Theoretical Computer Science | 2015-09-16 | Paper |
Reconfiguration of vertex covers in a graph
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Deterministic Algorithms for the Independent Feedback Vertex Set Problem
Lecture Notes in Computer Science | 2015-09-15 | Paper |
The minimum vulnerability problem on graphs
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Fixed-parameter tractability of token jumping on planar graphs
Algorithms and Computation | 2015-09-11 | Paper |
Polynomial-time algorithm for sliding tokens on trees
Algorithms and Computation | 2015-09-11 | Paper |
Minimum-cost \(b\)-edge dominating sets on trees
Algorithms and Computation | 2015-09-11 | Paper |
The list coloring reconfiguration problem for bounded pathwidth graphs
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Swapping labeled tokens on graphs
Theoretical Computer Science | 2015-05-26 | Paper |
Approximability of the subset sum reconfiguration problem
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
Generalized rainbow connectivity of graphs
Theoretical Computer Science | 2014-10-06 | Paper |
Base-object location problems for base-monotone regions
Theoretical Computer Science | 2014-10-06 | Paper |
Complexity of finding maximum regular induced subgraphs with prescribed degree
Theoretical Computer Science | 2014-08-26 | Paper |
Reconfiguration of list \(L(2,1)\)-labelings in a graph
Theoretical Computer Science | 2014-07-07 | Paper |
A 4.31-approximation for the geometric unique coverage problem on unit disks
Theoretical Computer Science | 2014-07-07 | Paper |
On the Parameterized Complexity for Token Jumping on Graphs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
On the rainbow connectivity of graphs: complexity and FPT algorithms
Algorithmica | 2013-11-11 | Paper |
Complexity of finding maximum regular induced subgraphs with prescribed degree
Fundamentals of Computation Theory | 2013-08-16 | Paper |
A characterization of graphs with fractional total chromatic number equal to \(\Delta +2\)
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
On the minimum caterpillar problem in digraphs
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Generalized rainbow connectivity of graphs
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Base Location Problems for Base-Monotone Regions
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Reconfiguration of list \(L(2,1)\)-labelings in a graph
Algorithms and Computation | 2013-03-21 | Paper |
A 4.31-approximation for the geometric unique coverage problem on unit disks
Algorithms and Computation | 2013-03-21 | Paper |
Route-enabling graph orientation problems
Algorithmica | 2013-03-05 | Paper |
Minimum cost partitions of trees with supply and demand
Algorithmica | 2013-01-28 | Paper |
Reconfiguration of list edge-colorings in a graph
Discrete Applied Mathematics | 2012-10-26 | Paper |
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Partitioning a weighted tree into subtrees with weights in a given range
Algorithmica | 2012-04-26 | Paper |
Parameterizing cut sets in a graph by the number of their components
Theoretical Computer Science | 2012-01-09 | Paper |
On the rainbow connectivity of graphs: complexity and FPT algorithms
Lecture Notes in Computer Science | 2011-08-17 | Paper |
On disconnected cuts and separators
Discrete Applied Mathematics | 2011-08-10 | Paper |
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Approximability of the Subset Sum Reconfiguration Problem
Lecture Notes in Computer Science | 2011-07-01 | Paper |
On the complexity of reconfiguration problems
Theoretical Computer Science | 2011-03-14 | Paper |
Minimum Cost Partitions of Trees with Supply and Demand
Algorithms and Computation | 2010-12-09 | Paper |
Minimum cost edge-colorings of trees can be reduced to matchings
Frontiers in Algorithmics | 2010-09-07 | Paper |
Partitioning graphs of supply and demand
Discrete Applied Mathematics | 2010-04-28 | Paper |
Route-enabling graph orientation problems
Algorithms and Computation | 2009-12-17 | Paper |
Parameterizing cut sets in a graph by the number of their components
Algorithms and Computation | 2009-12-17 | Paper |
Reconfiguration of List Edge-Colorings in a Graph
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Approximability of partitioning graphs with supply and demand
Journal of Discrete Algorithms | 2009-02-23 | Paper |
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
Algorithms and Computation | 2009-01-29 | Paper |
On the Complexity of Reconfiguration Problems
Algorithms and Computation | 2009-01-29 | Paper |
Approximability of Partitioning Graphs with Supply and Demand
Algorithms and Computation | 2008-04-24 | Paper |
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Journal of Discrete Algorithms | 2008-01-11 | Paper |
Algorithms for finding distance-edge-colorings of graphs
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
PARTITIONING TREES OF SUPPLY AND DEMAND
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
| scientific article; zbMATH DE number 2089998 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 1979534 (Why is no real title available?) | 2003-09-14 | Paper |
Complete surfaces in $E^{4}$ with constant mean curvature
Kodai Mathematical Journal | 1970-01-01 | Paper |
