| Publication | Date of Publication | Type |
|---|
| Hardness of pre-assignment problem for unique minimum vertex cover on planar graphs with maximum degree 3 | 2026-02-26 | Paper |
Properties of Euclidean minimum weight \((k, \ell)\)-tight graphs
Discrete Applied Mathematics | 2025-12-16 | Paper |
| Shortest cover after edit | 2025-12-02 | Paper |
Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs
Discrete Applied Mathematics | 2024-12-04 | Paper |
| Multifold tiles of polyominoes and convex lattice polygons | 2024-04-09 | Paper |
Efficient folding algorithms for convex polyhedra
Discrete & Computational Geometry | 2023-12-21 | Paper |
Internal longest palindrome queries in optimal time
Lecture Notes in Computer Science | 2023-11-24 | Paper |
Finding top-\(k\) longest palindromes in substrings
Theoretical Computer Science | 2023-10-26 | Paper |
| scientific article; zbMATH DE number 7578491 (Why is no real title available?) | 2022-08-31 | Paper |
Efficient segment folding is hard
Computational Geometry | 2022-04-08 | Paper |
| RePair Grammars are the Smallest Grammars for Fibonacci Words | 2022-02-16 | Paper |
Algorithmic enumeration of surrounding polygons
Discrete Applied Mathematics | 2021-09-15 | Paper |
Longest common subsequence in sublinear space
Information Processing Letters | 2021-03-11 | Paper |
Optimal reconfiguration of optimal ladder lotteries
Theoretical Computer Science | 2021-02-15 | Paper |
Rigid foldability is NP-hard
(available as arXiv preprint) | 2020-09-09 | Paper |
Implicit enumeration of topological-minor-embeddings and its application to planar subgraph enumeration
(available as arXiv preprint) | 2020-07-22 | Paper |
| Exact algorithms for the max-min dispersion problem | 2020-07-07 | Paper |
| Max-Min 3-Dispersion problems | 2020-02-24 | Paper |
Efficient Algorithm for Box Folding
Journal of Graph Algorithms and Applications | 2020-02-17 | Paper |
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
(available as arXiv preprint) | 2019-11-18 | Paper |
| Efficient algorithm for box folding | 2019-10-15 | Paper |
| Decomposing a Graph into Unigraphs | 2019-04-20 | Paper |
Sequentially swapping colored tokens on graphs
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
| Computational complexity of robot arm simulation problems | 2018-09-06 | Paper |
Swapping colored tokens on graphs
Theoretical Computer Science | 2018-05-17 | Paper |
Complexity of tiling a polygon with trominoes or bars
Discrete & Computational Geometry | 2017-10-25 | Paper |
Common developments of three incongruent boxes of area 30
Computational Geometry | 2017-08-21 | Paper |
| Convex configurations on Nana-kin-san puzzle | 2017-07-17 | Paper |
Generating all patterns of graph partitions within a disparity bound
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Sequentially swapping colored tokens on graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Continuous folding of regular dodecahedra
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Box pleating is hard
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Common unfolding of regular tetrahedron and Johnson-Zalgaller solid
Journal of Graph Algorithms and Applications | 2016-03-03 | Paper |
Swapping Colored Tokens on Graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Common developments of three incongruent boxes of area 30
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Common unfolding of regular tetrahedron and Johnson-Zalgaller solid
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Base-object location problems for base-monotone regions
Theoretical Computer Science | 2014-10-06 | Paper |
The number of different unfoldings of polyhedra
Algorithms and Computation | 2014-01-14 | Paper |
| How to collect balls moving in the Euclidean plane | 2013-08-30 | Paper |
Base Location Problems for Base-Monotone Regions
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Generation of Polyiamonds for p6 Tiling by the Reverse Search
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
Translation among CNFs, characteristic models and ordered binary decision diagrams
Information Processing Letters | 2009-03-23 | Paper |
Finite-State Online Algorithms and Their Automated Competitive Analysis
Algorithms and Computation | 2008-04-24 | Paper |
How to collect balls moving in the Euclidean plane
Discrete Applied Mathematics | 2007-01-09 | Paper |
Density condensation of Boolean formulas
Discrete Applied Mathematics | 2007-01-09 | Paper |
Reasoning with ordered binary decision diagrams
Discrete Applied Mathematics | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2080240 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080994 (Why is no real title available?) | 2004-08-04 | Paper |
Finding essential attributes from binary data
Annals of Mathematics and Artificial Intelligence | 2003-08-21 | Paper |
Ordered binary decision diagrams as knowledge-bases
Artificial Intelligence | 2002-07-15 | Paper |
Deduction and abduction with ordered binary decision diagrams
RIMS Kokyuroku | 2001-09-17 | Paper |
| scientific article; zbMATH DE number 1522923 (Why is no real title available?) | 2000-10-30 | Paper |
| scientific article; zbMATH DE number 1511702 (Why is no real title available?) | 2000-09-27 | Paper |
