| Publication | Date of Publication | Type |
|---|
| Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs | 2024-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126509 | 2024-04-09 | Paper |
| Efficient folding algorithms for convex polyhedra | 2023-12-21 | Paper |
| Finding top-\(k\) longest palindromes in substrings | 2023-11-24 | Paper |
| Finding top-\(k\) longest palindromes in substrings | 2023-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5098805 | 2022-08-31 | Paper |
| Efficient segment folding is hard | 2022-04-08 | Paper |
| RePair Grammars are the Smallest Grammars for Fibonacci Words | 2022-02-16 | Paper |
| Algorithmic enumeration of surrounding polygons | 2021-09-15 | Paper |
| Longest common subsequence in sublinear space | 2021-03-11 | Paper |
| Optimal reconfiguration of optimal ladder lotteries | 2021-02-15 | Paper |
| Rigid foldability is NP-hard | 2020-09-09 | Paper |
| Implicit enumeration of topological-minor-embeddings and its application to planar subgraph enumeration | 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 | 2020-02-17 | Paper |
| Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration | 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 | 2019-02-14 | Paper |
| Computational complexity of robot arm simulation problems | 2018-09-06 | Paper |
| Swapping colored tokens on graphs | 2018-05-17 | Paper |
| Complexity of tiling a polygon with trominoes or bars | 2017-10-25 | Paper |
| Common developments of three incongruent boxes of area 30 | 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 | 2017-05-05 | Paper |
| Sequentially Swapping Colored Tokens on Graphs | 2017-05-05 | Paper |
| Continuous Folding of Regular Dodecahedra | 2017-02-01 | Paper |
| Box Pleating is Hard | 2017-02-01 | Paper |
| Common unfolding of regular tetrahedron and Johnson-Zalgaller solid | 2016-03-03 | Paper |
| Swapping Colored Tokens on Graphs | 2015-10-30 | Paper |
| Common Developments of Three Incongruent Boxes of Area 30 | 2015-09-30 | Paper |
| Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid | 2015-02-27 | Paper |
| Base-object location problems for base-monotone regions | 2014-10-06 | Paper |
| The Number of Different Unfoldings of Polyhedra | 2014-01-14 | Paper |
| How to collect balls moving in the Euclidean plane | 2013-08-30 | Paper |
| Base Location Problems for Base-Monotone Regions | 2013-04-12 | Paper |
| Generation of Polyiamonds for p6 Tiling by the Reverse Search | 2011-11-11 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| Translation among CNFs, characteristic models and ordered binary decision diagrams | 2009-03-23 | Paper |
| Finite-State Online Algorithms and Their Automated Competitive Analysis | 2008-04-24 | Paper |
| How to collect balls moving in the Euclidean plane | 2007-01-09 | Paper |
| Density condensation of Boolean formulas | 2007-01-09 | Paper |
| Reasoning with ordered binary decision diagrams | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472485 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474092 | 2004-08-04 | Paper |
| Finding essential attributes from binary data | 2003-08-21 | Paper |
| Ordered binary decision diagrams as knowledge-bases | 2002-07-15 | Paper |
| Deduction and abduction with ordered binary decision diagrams | 2001-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511219 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505388 | 2000-09-27 | Paper |
