default search action
Discrete Applied Mathematics, Volume 125
Volume 125, Number 1, January 2003
- Rafael Ayala, Eladio Domínguez, Angel R. Francés, Antonio Quintero:
Homotopy in digital spaces. 3-24 - Vladimir Kovalevsky:
Multidimensional cell lists for investigating 3-manifolds. 25-43 - Mohammed Khachan, Patrick Chenin, Hafsa Deddi:
Digital pseudomanifolds, digital weakmanifolds and Jordan-Brouwer separation theorem. 45-57 - Sébastien Fourey, Rémy Malgouyres:
A concise characterization of 3D simple points. 59-80 - Christoph Lincke, Charles Albert Wüthrich:
Surface digitizations by dilations which are tunnel-free. 81-91 - Jasmine Burguet, Rémy Malgouyres:
Strong thinning and polyhedric approximation of the surface of a voxel object. 93-114 - Isabelle Debled-Rennesson, Jean-Luc Rémy, Jocelyne Rouyer-Degli:
Detection of the discrete convexity of polyominoes. 115-133 - Peter Veelaert:
Graph-theoretical properties of parallelism in the digital plane. 135-160 - Gunilla Borgefors:
Weighted digital distance transforms in four dimensions. 161-176
Volume 125, Number 2-3, February 2003
- John V. Franco, Allen Van Gelder:
A perspective on certain polynomial-time solvable classes of satisfiability. 177-214 - Michael U. Gerber, Vadim V. Lozin:
On the stable set problem in special P5-free graphs. 215-224 - F. Jelen, Eberhard Triesch:
Superdominance order and distance of trees with bounded maximum degree. 225-233 - Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
The complexity of compressing subsegments of images described by finite automata. 235-254 - Martin Knor, Ludovít Niepel:
Connectivity of iterated line graphs. 255-266 - Piotr Krysta:
Approximating minimum size {1, 2}-connected network. 267-288 - Jia-Yan Yao:
Opacity of a finite automaton, method of calculation and the Ising chain. 289-318
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.