| Publication | Date of Publication | Type |
|---|
Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes
Theoretical Computer Science | 2024-06-04 | Paper |
Overlapping edge unfoldings for convex regular-faced polyhedra
Theoretical Computer Science | 2024-06-03 | Paper |
Sorting balls and water: equivalence and computational complexity
| 2024-05-16 | Paper |
Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Overlapping edge unfoldings for Archimedean solids and (anti)prisms
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Path cover problems with length cost
Algorithmica | 2023-11-17 | Paper |
Sorting balls and water: equivalence and computational complexity
Theoretical Computer Science | 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
Discrete Applied Mathematics | 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
Theoretical Computer Science | 2020-01-16 | Paper |
Finding all solutions and instances of Numberlink and Slitherlink by ZDDs
Algorithms | 2019-03-26 | Paper |
Sequentially swapping colored tokens on graphs
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
The time complexity of permutation routing via matching, token swapping and a variant
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
Computational complexity of robot arm simulation problems
| 2018-09-06 | Paper |
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
WALCOM: Algorithms and Computation | 2018-06-15 | Paper |
Complexity of the maximum \(k\)-path vertex cover problem
| 2018-06-15 | Paper |
Swapping colored tokens on graphs
Theoretical Computer Science | 2018-05-17 | Paper |
Extending partial representations of interval graphs
Algorithmica | 2017-10-09 | Paper |
The time complexity of the token swapping problem and its parallel variants
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Sequentially swapping colored tokens on graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Extending partial representations of proper and unit interval graphs
Algorithmica | 2017-05-02 | Paper |
Ferrers dimension of grid intersection graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
A boundary element method for wave scattering in fluid-saturated porous rocks
WIT Transactions on Modelling and Simulation | 2016-06-10 | Paper |
Swapping Colored Tokens on Graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Competitive diffusion on weighted graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Swapping labeled tokens on graphs
Theoretical Computer Science | 2015-05-26 | Paper |
Extending partial representations of subclasses of chordal graphs
Theoretical Computer Science | 2015-05-18 | Paper |
Extending partial representations of proper and unit interval graphs
Lecture Notes in Computer Science | 2014-09-02 | Paper |
Intersection dimension of bipartite graphs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Approximating the path-distance-width for AT-free graphs and graphs in related classes
Discrete Applied Mathematics | 2014-04-02 | Paper |
The complexity of the stamp folding problem
Theoretical Computer Science | 2014-01-10 | Paper |
Extending Partial Representations of Subclasses of Chordal Graphs
Algorithms and Computation | 2013-03-21 | Paper |
Subgraph isomorphism in graph classes
Discrete Mathematics | 2012-10-16 | Paper |
Bipartite permutation graphs are reconstructible
Discrete Mathematics, Algorithms and Applications | 2012-10-15 | Paper |
Random generation and enumeration of bipartite permutation graphs
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Approximability of the path-distance-width for AT-free graphs
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Complexity of the stamp folding problem
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Bipartite Permutation Graphs Are Reconstructible
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Reconstruction of interval graphs
Theoretical Computer Science | 2010-11-11 | Paper |
Reconstruction Algorithm for Permutation Graphs
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Random Generation and Enumeration of Bipartite Permutation Graphs
Algorithms and Computation | 2009-12-17 | Paper |
Reconstruction of Interval Graphs
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Random Generation and Enumeration of Proper Interval Graphs
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
