| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7583739 (Why is no real title available?) | 2022-09-09 | Paper |
| Some non-trivial examples of equiprojective polyhedra | 2022-06-10 | Paper |
Cutting out polygon collections with a saw
Discrete Applied Mathematics | 2017-06-19 | Paper |
CUTTING OUT POLYGONS WITH A CIRCULAR SAW
International Journal of Computational Geometry & Applications | 2015-12-22 | Paper |
Pancake flipping and sorting permutations
Journal of Discrete Algorithms | 2015-08-18 | Paper |
On collections of polygons cuttable with a segment saw
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
On fixed size projection of simplicial polyhedra
Information Processing Letters | 2014-04-14 | Paper |
Prefix transpositions on binary and ternary strings
Information Processing Letters | 2013-06-28 | Paper |
Cutting a convex polyhedron out of a sphere
Graphs and Combinatorics | 2012-01-24 | Paper |
Cutting out polygons with a circular saw
Algorithms and Computation | 2011-12-16 | Paper |
Efficient view point selection for silhouettes of convex polyhedra
Computational Geometry | 2011-08-02 | Paper |
Computing nice projections of convex polyhedra
International Journal of Computational Geometry & Applications | 2011-06-17 | Paper |
Solving the generalized subset sum problem with a light based device
Natural Computing | 2011-05-23 | Paper |
Reconstructing convex polygons and convex polyhedra from edge and face counts in orthogonal projections
International Journal of Computational Geometry & Applications | 2011-05-11 | Paper |
Cache oblivious algorithms for the RMQ and the RMSQ problems
Mathematics in Computer Science | 2011-02-19 | Paper |
The 1.375 approximation algorithm for sorting by transpositions can run in \(O(n\log n)\) time
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Cutting a Convex Polyhedron Out of a Sphere
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
An approximation algorithm for sorting by reversals and transpositions
Journal of Discrete Algorithms | 2009-05-13 | Paper |
Maximum Neighbour Voronoi Games
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Equiprojective polyhedra
Computational Geometry | 2008-04-28 | Paper |
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Computing Nice Projections of Convex Polyhedra
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity
Distributed Computing and Networking | 2008-03-06 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
A linear algorithm for compact box-drawings of trees
Networks | 2003-10-29 | Paper |
