| Publication | Date of Publication | Type |
|---|
Gathering on a circle with limited visibility by anonymous oblivious robots
Theoretical Computer Science | 2024-12-12 | Paper |
Reconfiguration of vertex-disjoint shortest paths on graphs
Journal of Graph Algorithms and Applications | 2024-11-12 | Paper |
| Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis | 2024-07-19 | Paper |
| Compacting squares: input-sensitive in-place reconfiguration of sliding squares | 2024-05-27 | Paper |
| Rolling polyhedra on tessellations | 2024-05-16 | Paper |
| Sorting balls and water: equivalence and computational complexity | 2024-05-16 | Paper |
| Multifold tiles of polyominoes and convex lattice polygons | 2024-04-09 | Paper |
| Clarifying the difference between origami fold models by a matrix representation | 2024-04-09 | Paper |
Fast RNC and NC algorithms for finding a maximal set of paths with an application
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
Discrete Applied Mathematics | 2024-01-24 | Paper |
Computational complexity of jumping block puzzles
Theoretical Computer Science | 2024-01-05 | Paper |
Efficient folding algorithms for convex polyhedra
Discrete & Computational Geometry | 2023-12-21 | Paper |
Computational complexity of puzzles and related topics
Interdisciplinary Information Sciences (IIS) | 2023-12-15 | Paper |
Reconfiguration of vertex-disjoint shortest paths on graphs
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
| Gathering on a circle with limited visibility by anonymous oblivious robots | 2023-11-02 | Paper |
Sorting balls and water: equivalence and computational complexity
Theoretical Computer Science | 2023-10-12 | Paper |
Any Platonic solid can transform to another by \(O(1)\) refoldings
Computational Geometry | 2023-07-12 | Paper |
| Toward unfolding doubly covered \(n\)-stars | 2023-03-31 | Paper |
| Packing cube nets into rectangles with \(O(1)\) holes | 2023-03-31 | Paper |
Computational complexity of jumping block puzzles
(available as arXiv preprint) | 2023-03-30 | Paper |
| Token shifting on graphs | 2023-03-30 | Paper |
| scientific article; zbMATH DE number 7650265 (Why is no real title available?) | 2023-02-03 | Paper |
Mathematical characterizations and computational complexity of anti-slide puzzles
Theoretical Computer Science | 2022-11-17 | Paper |
Developing a tetramonohedron with minimum cut length
Computational Geometry | 2022-10-06 | Paper |
A survey and recent results about commmon developments of two or more boxes
Origami⁶ | 2022-05-24 | Paper |
Ununfoldable polyhedra with \(6\) vertices or \(6\) faces
Computational Geometry | 2022-04-08 | Paper |
Efficient segment folding is hard
Computational Geometry | 2022-04-08 | Paper |
Cyclic shift problems on graphs
(available as arXiv preprint) | 2021-10-04 | Paper |
Mathematical characterizations and computational complexity of anti-slide puzzles
WALCOM: Algorithms and Computation | 2021-10-04 | Paper |
| Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs | 2021-10-04 | Paper |
Algorithmic enumeration of surrounding polygons
Discrete Applied Mathematics | 2021-09-15 | Paper |
Shortest reconfiguration of sliding tokens on subclasses of interval graphs
Theoretical Computer Science | 2021-03-18 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Computational Geometry | 2020-10-23 | Paper |
| Efficient enumeration of non-isomorphic Ptolemaic graphs | 2020-07-22 | Paper |
| Introduction to computational origami. The world of new computational geometry | 2020-07-20 | Paper |
| scientific article; zbMATH DE number 7219428 (Why is no real title available?) | 2020-07-10 | Paper |
| Exact algorithms for the max-min dispersion problem | 2020-07-07 | Paper |
Parameterized complexity of independent set reconfiguration problems
Discrete Applied Mathematics | 2020-06-29 | 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 |
Shortest reconfiguration sequence for sliding tokens on spiders
(available as arXiv preprint) | 2020-02-06 | Paper |
Reconfiguring undirected paths
(available as arXiv preprint) | 2020-01-16 | Paper |
| Reconfiguring undirected paths | 2020-01-16 | Paper |
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
Theoretical Computer Science | 2020-01-16 | Paper |
| Efficient algorithm for box folding | 2019-10-15 | Paper |
Tractabilities and intractabilities on geometric intersection graphs
Algorithms | 2019-03-26 | Paper |
Any monotone function is realized by interlocked polygons
Algorithms | 2019-03-26 | Paper |
Flat foldings of plane graphs with prescribed angles and edge lengths
(available as arXiv preprint) | 2019-02-27 | Paper |
| First course in algorithms through puzzles | 2019-02-18 | Paper |
Sequentially swapping colored tokens on graphs
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
Bumpy pyramid folding
Computational Geometry | 2018-10-31 | Paper |
| Computational complexity of robot arm simulation problems | 2018-09-06 | Paper |
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
(available as arXiv preprint) | 2018-06-21 | 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 |
| Sliding tokens on a cactus | 2018-04-19 | 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 |
Sequentially swapping colored tokens on graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Sliding tokens on block graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
| Polynomial-Time Algorithms for Sliding Tokens on Cactus Graphs and Block Graphs | 2017-05-01 | Paper |
Box pleating is hard
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Ferrers dimension of grid intersection graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Parallel approximation algorithms for maximum weighted matching in general graphs
Information Processing Letters | 2016-06-16 | Paper |
Efficient algorithms for a simple network design problem
Networks | 2016-06-10 | Paper |
Collapse of PP with a semi-random source to BPP
Information Processing Letters | 2016-05-26 | Paper |
Shortest Reconfiguration of Sliding Tokens on a Caterpillar
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Common unfolding of regular tetrahedron and Johnson-Zalgaller solid
Journal of Graph Algorithms and Applications | 2016-03-03 | Paper |
Folding a paper strip to minimize thickness
Journal of Discrete Algorithms | 2016-02-18 | Paper |
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
Computational Geometry | 2016-01-18 | Paper |
Sliding token on bipartite permutation graphs
Algorithms and Computation | 2016-01-11 | Paper |
Common developments of three incongruent orthogonal boxes
International Journal of Computational Geometry & Applications | 2015-12-22 | Paper |
Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
Discrete Applied Mathematics | 2015-12-10 | Paper |
Competitive diffusion on weighted graphs
Lecture Notes in Computer Science | 2015-10-30 | 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 |
Linear-time algorithm for sliding tokens on trees
Theoretical Computer Science | 2015-09-16 | Paper |
Polynomial-time algorithm for sliding tokens on trees
Algorithms and Computation | 2015-09-11 | Paper |
Depth-First Search Using $$O(n)$$ Bits
Algorithms and Computation | 2015-09-11 | Paper |
The height of random k‐trees and related branching processes
Random Structures & Algorithms | 2015-06-22 | Paper |
A measure for the lexicographically first maximal independent set problem and its limits
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Common unfolding of regular tetrahedron and Johnson-Zalgaller solid
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Folding a paper strip to minimize thickness
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
| Cell-paths in mono- and bichromatic line arrangements in the plane | 2015-02-09 | Paper |
Flat foldings of plane graphs with prescribed angles and edge lengths
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
The graph isomorphism problem on geometric graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2014-11-10 | Paper |
Base-object location problems for base-monotone regions
Theoretical Computer Science | 2014-10-06 | Paper |
A 4.31-approximation for the geometric unique coverage problem on unit disks
Theoretical Computer Science | 2014-07-07 | Paper |
Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
On the Parameterized Complexity for Token Jumping on Graphs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Intersection dimension of bipartite graphs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
| On bipartite powers of bigraphs | 2014-03-25 | Paper |
UNO is hard, even for a single player
Theoretical Computer Science | 2014-01-22 | Paper |
The complexity of the stamp folding problem
Theoretical Computer Science | 2014-01-10 | Paper |
On complexity of flooding games on graphs with interval representations
Computational Geometry and Graphs | 2013-12-06 | Paper |
The Voronoi game on graphs and its complexity
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Variations on instant insanity
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
Discrete Mathematics, Algorithms and Applications | 2013-09-05 | Paper |
Ghost chimneys
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Base Location Problems for Base-Monotone Regions
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
A 4.31-approximation for the geometric unique coverage problem on unit disks
Algorithms and Computation | 2013-03-21 | Paper |
Route-enabling graph orientation problems
Algorithmica | 2013-03-05 | Paper |
| scientific article; zbMATH DE number 6139736 (Why is no real title available?) | 2013-02-28 | Paper |
Bipartite permutation graphs are reconstructible
Discrete Mathematics, Algorithms and Applications | 2012-10-15 | Paper |
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Information Sciences | 2012-10-02 | Paper |
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Random generation and enumeration of bipartite permutation graphs
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Algorithmic folding complexity
Graphs and Combinatorics | 2012-01-24 | Paper |
Complexity of the stamp folding problem
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
Lecture Notes in Computer Science | 2011-07-01 | Paper |
On the complexity of reconfiguration problems
Theoretical Computer Science | 2011-03-14 | Paper |
Scale free properties of random \(k\)-trees
Mathematics in Computer Science | 2011-02-19 | Paper |
Bipartite Permutation Graphs Are Reconstructible
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
On computing longest paths in small graph classes
International Journal of Foundations of Computer Science | 2011-01-06 | Paper |
Reconstruction of interval graphs
Theoretical Computer Science | 2010-11-11 | Paper |
Enumeration of the perfect sequences of a chordal graph
Theoretical Computer Science | 2010-10-11 | Paper |
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Subexponential interval graphs generated by immigration-death processes
Probability in the Engineering and Informational Sciences | 2010-05-26 | Paper |
Efficient enumeration of all ladder lotteries and its application
Theoretical Computer Science | 2010-04-15 | Paper |
Linear structure of bipartite permutation graphs and the longest path problem
Information Processing Letters | 2010-03-24 | Paper |
Reconstruction Algorithm for Permutation Graphs
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Counting the number of matchings in chordal and chordal bipartite graph classes
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Tree spanners for bipartite graphs and probe interval graphs.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Route-enabling graph orientation problems
Algorithms and Computation | 2009-12-17 | Paper |
Algorithmic folding complexity
Algorithms and Computation | 2009-12-17 | Paper |
Random Generation and Enumeration of Bipartite Permutation Graphs
Algorithms and Computation | 2009-12-17 | Paper |
Scale free interval graphs
Theoretical Computer Science | 2009-11-04 | Paper |
Reconstruction of Interval Graphs
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Laminar structure of ptolemaic graphs with applications
Discrete Applied Mathematics | 2009-06-30 | Paper |
Random Generation and Enumeration of Proper Interval Graphs
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
On the Complexity of Reconfiguration Problems
Algorithms and Computation | 2009-01-29 | Paper |
Bandwidth of Bipartite Permutation Graphs
Algorithms and Computation | 2009-01-29 | Paper |
Enumeration of Perfect Sequences of Chordal Graph
Algorithms and Computation | 2009-01-29 | Paper |
Counting the number of independent sets in chordal graphs
Journal of Discrete Algorithms | 2008-08-08 | Paper |
Scale Free Interval Graphs
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Simple Geometrical Intersection Graphs
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
Efficient Algorithms for Airline Problem
Lecture Notes in Computer Science | 2007-11-13 | Paper |
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Tree spanners for bipartite graphs and probe interval graphs
Algorithmica | 2007-03-05 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2086689 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1759463 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1741092 (Why is no real title available?) | 2002-05-15 | Paper |
| Unique solution instance generation for the 3-satisfiability (3SAT) problem | 2001-10-21 | Paper |
| scientific article; zbMATH DE number 1511711 (Why is no real title available?) | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1380810 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1322337 (Why is no real title available?) | 1999-11-08 | Paper |
Fast RNC and NC algorithms for maximal path sets
Theoretical Computer Science | 1999-04-28 | Paper |
| scientific article; zbMATH DE number 1107742 (Why is no real title available?) | 1998-06-23 | Paper |
Efficient simulations by a biased coin
Information Processing Letters | 1997-02-27 | Paper |
