DCG
2010
13 years 5 months ago
2010
: We investigate polyhedral 2k-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex k-Hamiltonian if it contains the full k-skeleton o...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
JCDCG
1998
Springer
13 years 9 months ago
1998
Springer
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygo...
HYBRID
1998
Springer
13 years 9 months ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
RT
2001
Springer
13 years 10 months ago
2001
Springer
The known sampling methods can roughly be grouped into regular and irregular sampling. While regular sampling can be realized efficiently in graphics hardware, it is prone to inte...
CHARME
2005
Springer
13 years 11 months ago
2005
Springer
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...