| Publication | Date of Publication | Type |
|---|
| 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 | 2024-11-12 | Paper |
| Algorithmic meta-theorems for combinatorial reconfiguration revisited | 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 | 2024-01-16 | Paper |
| Algorithmic theory of qubit routing | 2024-01-16 | Paper |
| Reconfiguration of vertex-disjoint shortest paths on graphs | 2023-11-24 | Paper |
| Happy set problem on subclasses of co-comparability graphs | 2023-11-17 | Paper |
| Minimization and parameterized variants of vertex partition problems on graphs | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6089660 | 2023-11-13 | Paper |
| On reachable assignments under dichotomous preferences | 2023-10-26 | Paper |
| Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams | 2023-10-23 | Paper |
| Sorting balls and water: equivalence and computational complexity | 2023-10-12 | Paper |
| ZDD-based algorithmic framework for solving shortest reconfiguration problems | 2023-10-04 | Paper |
| Reconfiguration of spanning trees with degree constraints or diameter constraints | 2023-09-27 | Paper |
| Fixed-parameter algorithms for graph constraint logic | 2023-05-12 | Paper |
| Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra | 2023-04-28 | Paper |
| Reconfiguration of cliques in a graph | 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 | 2023-02-07 | Paper |
| Reconfiguring (non-spanning) arborescences | 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 | 2022-07-22 | Paper |
| The Perfect Matching Reconfiguration Problem | 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 | 2022-07-18 | Paper |
| Invitation to combinatorial reconfiguration | 2022-07-13 | Paper |
| Reconfiguration of regular induced subgraphs | 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 |
| https://portal.mardi4nfdi.de/entity/Q5075806 | 2022-05-11 | Paper |
| Shortest Reconfiguration of Perfect Matchings via Alternating Cycles | 2022-05-10 | Paper |
| Independent set reconfiguration on directed graphs | 2022-03-24 | Paper |
| Algorithms for gerrymandering over graphs | 2021-05-10 | Paper |
| Approximability of the independent feedback vertex set problem for bipartite graphs | 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 | 2020-10-12 | Paper |
| Diameter of colorings under Kempe changes | 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 | 2020-07-22 | Paper |
| Parameterized complexity of independent set reconfiguration problems | 2020-06-29 | Paper |
| Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters | 2020-05-26 | Paper |
| Incremental optimization of independent sets under the reconfiguration framework | 2020-02-24 | Paper |
| Shortest reconfiguration of matchings | 2020-02-24 | Paper |
| Diameter of colorings under Kempe changes | 2020-02-24 | Paper |
| Reconfiguring spanning and induced subgraphs | 2020-01-16 | Paper |
| Reconfiguration of maximum-weight \(b\)-matchings in a graph | 2019-06-06 | Paper |
| Reconfiguration of colorable sets in classes of perfect graphs | 2019-05-17 | Paper |
| Minimum-cost \(b\)-edge dominating sets on trees | 2019-01-11 | Paper |
| Reconfiguring spanning and induced subgraphs | 2018-10-04 | Paper |
| Parameterized complexity of the list coloring reconfiguration problem with graph parameters | 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 | 2017-10-25 | Paper |
| Reconfiguration of maximum weight \(b\)-matchings in a graph | 2017-10-23 | Paper |
| Efficient stabilization of cooperative matching games | 2017-05-15 | Paper |
| Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs | 2017-05-05 | Paper |
| The Complexity of (List) Edge-Coloring Reconfiguration Problem | 2017-05-05 | Paper |
| The complexity of dominating set reconfiguration | 2017-03-16 | Paper |
| Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs | 2017-02-01 | Paper |
| The minimum vulnerability problem on specific graph classes | 2016-11-29 | Paper |
| Reconfiguration of Steiner Trees in an Unweighted Graph | 2016-09-29 | Paper |
| A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares | 2016-01-18 | Paper |
| The Complexity of Dominating Set Reconfiguration | 2015-10-30 | Paper |
| Competitive Diffusion on Weighted Graphs | 2015-10-30 | Paper |
| Reconfiguration of Cliques in a Graph | 2015-09-30 | Paper |
| Linear-time algorithm for sliding tokens on trees | 2015-09-16 | Paper |
| Reconfiguration of Vertex Covers in a Graph | 2015-09-15 | Paper |
| Deterministic Algorithms for the Independent Feedback Vertex Set Problem | 2015-09-15 | Paper |
| The Minimum Vulnerability Problem on Graphs | 2015-09-11 | Paper |
| Fixed-Parameter Tractability of Token Jumping on Planar Graphs | 2015-09-11 | Paper |
| Polynomial-Time Algorithm for Sliding Tokens on Trees | 2015-09-11 | Paper |
| Minimum-Cost $$b$$-Edge Dominating Sets on Trees | 2015-09-11 | Paper |
| The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs | 2015-09-11 | Paper |
| Swapping labeled tokens on graphs | 2015-05-26 | Paper |
| Approximability of the subset sum reconfiguration problem | 2015-01-21 | Paper |
| Generalized rainbow connectivity of graphs | 2014-10-06 | Paper |
| Base-object location problems for base-monotone regions | 2014-10-06 | Paper |
| Complexity of finding maximum regular induced subgraphs with prescribed degree | 2014-08-26 | Paper |
| Reconfiguration of list \(L(2,1)\)-labelings in a graph | 2014-07-07 | Paper |
| A 4.31-approximation for the geometric unique coverage problem on unit disks | 2014-07-07 | Paper |
| On the Parameterized Complexity for Token Jumping on Graphs | 2014-04-16 | Paper |
| On the rainbow connectivity of graphs: complexity and FPT algorithms | 2013-11-11 | Paper |
| Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree | 2013-08-16 | Paper |
| A characterization of graphs with fractional total chromatic number equal to \(\Delta +2\) | 2013-07-19 | Paper |
| On the Minimum Caterpillar Problem in Digraphs | 2013-06-11 | Paper |
| Generalized Rainbow Connectivity of Graphs | 2013-04-12 | Paper |
| Base Location Problems for Base-Monotone Regions | 2013-04-12 | Paper |
| Reconfiguration of List L(2,1)-Labelings in a Graph | 2013-03-21 | Paper |
| A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks | 2013-03-21 | Paper |
| Route-enabling graph orientation problems | 2013-03-05 | Paper |
| Minimum cost partitions of trees with supply and demand | 2013-01-28 | Paper |
| Reconfiguration of list edge-colorings in a graph | 2012-10-26 | Paper |
| A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares | 2012-08-14 | Paper |
| Partitioning a weighted tree into subtrees with weights in a given range | 2012-04-26 | Paper |
| Parameterizing cut sets in a graph by the number of their components | 2012-01-09 | Paper |
| On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms | 2011-08-17 | Paper |
| On disconnected cuts and separators | 2011-08-10 | Paper |
| An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree | 2011-07-01 | Paper |
| Approximability of the Subset Sum Reconfiguration Problem | 2011-07-01 | Paper |
| On the complexity of reconfiguration problems | 2011-03-14 | Paper |
| Minimum Cost Partitions of Trees with Supply and Demand | 2010-12-09 | Paper |
| Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings | 2010-09-07 | Paper |
| Partitioning graphs of supply and demand | 2010-04-28 | Paper |
| Route-Enabling Graph Orientation Problems | 2009-12-17 | Paper |
| Parameterizing Cut Sets in a Graph by the Number of Their Components | 2009-12-17 | Paper |
| Reconfiguration of List Edge-Colorings in a Graph | 2009-10-20 | Paper |
| Approximability of partitioning graphs with supply and demand | 2009-02-23 | Paper |
| Partitioning a Weighted Tree to Subtrees of Almost Uniform Size | 2009-01-29 | Paper |
| On the Complexity of Reconfiguration Problems | 2009-01-29 | Paper |
| Approximability of Partitioning Graphs with Supply and Demand | 2008-04-24 | Paper |
| Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size | 2008-01-11 | Paper |
| Algorithms for finding distance-edge-colorings of graphs | 2007-10-30 | Paper |
| Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size | 2007-09-10 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| PARTITIONING TREES OF SUPPLY AND DEMAND | 2005-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808664 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427881 | 2003-09-14 | Paper |
| Complete surfaces in $E^{4}$ with constant mean curvature | 1970-01-01 | Paper |
