| Publication | Date of Publication | Type |
|---|
| Overlapping edge unfoldings for Archimedean solids and (anti)prisms | 2023-11-24 | Paper |
| Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs | 2023-11-24 | Paper |
| Path cover problems with length cost | 2023-11-17 | Paper |
| Sorting balls and water: equivalence and computational complexity | 2023-10-12 | Paper |
| Path cover problems with length cost | 2022-07-13 | Paper |
| Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes | 2021-10-04 | Paper |
| Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound | 2021-06-07 | Paper |
| Exact algorithms for the max-min dispersion problem | 2020-07-07 | Paper |
| Max-Min 3-Dispersion problems | 2020-02-24 | Paper |
| Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs | 2020-01-16 | Paper |
| Finding all solutions and instances of Numberlink and Slitherlink by ZDDs | 2019-03-26 | Paper |
| Sequentially Swapping Colored Tokens on Graphs | 2019-02-14 | Paper |
| The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant | 2019-02-14 | Paper |
| Computational complexity of robot arm simulation problems | 2018-09-06 | Paper |
| Complexity of the maximum \(k\)-path vertex cover problem | 2018-06-15 | Paper |
| Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs | 2018-06-15 | Paper |
| Swapping colored tokens on graphs | 2018-05-17 | Paper |
| Extending partial representations of interval graphs | 2017-10-09 | Paper |
| Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals | 2017-05-05 | Paper |
| Sequentially Swapping Colored Tokens on Graphs | 2017-05-05 | Paper |
| The Time Complexity of the Token Swapping Problem and Its Parallel Variants | 2017-05-05 | Paper |
| Extending partial representations of proper and unit interval graphs | 2017-05-02 | Paper |
| Ferrers dimension of grid intersection graphs | 2016-11-24 | Paper |
| Competitive Diffusion on Weighted Graphs | 2015-10-30 | Paper |
| Swapping Colored Tokens on Graphs | 2015-10-30 | Paper |
| Swapping labeled tokens on graphs | 2015-05-26 | Paper |
| Extending partial representations of subclasses of chordal graphs | 2015-05-18 | Paper |
| Extending partial representations of proper and unit interval graphs | 2014-09-02 | Paper |
| Intersection Dimension of Bipartite Graphs | 2014-04-16 | Paper |
| Approximating the path-distance-width for AT-free graphs and graphs in related classes | 2014-04-02 | Paper |
| The complexity of the stamp folding problem | 2014-01-10 | Paper |
| Extending Partial Representations of Subclasses of Chordal Graphs | 2013-03-21 | Paper |
| Subgraph isomorphism in graph classes | 2012-10-16 | Paper |
| BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE | 2012-10-15 | Paper |
| Random generation and enumeration of bipartite permutation graphs | 2012-05-11 | Paper |
| Approximability of the Path-Distance-Width for AT-free Graphs | 2011-12-16 | Paper |
| Complexity of the Stamp Folding Problem | 2011-08-12 | Paper |
| Extending partial representations of interval graphs | 2011-07-01 | Paper |
| Bipartite Permutation Graphs Are Reconstructible | 2011-01-10 | Paper |
| Reconstruction of interval graphs | 2010-11-11 | Paper |
| Reconstruction Algorithm for Permutation Graphs | 2010-02-09 | Paper |
| Random Generation and Enumeration of Bipartite Permutation Graphs | 2009-12-17 | Paper |
| Reconstruction of Interval Graphs | 2009-07-23 | Paper |
| Random Generation and Enumeration of Proper Interval Graphs | 2009-02-24 | Paper |
