Palágyi K, Németh G, Kardos P. Equivalent Sequential and Parallel Subiteration-Based Surface-Thinning Algorithms. In: Barneva RP, Bhattacharya B.B, Brimkov VE, editors. Proceedings of Combinatorial Image Analysis: 17th International Workshop, IWCIA 2015. Vol 9448. Calcutta, India: Springer; 2015. 3. p. 31-45p.  (Lecture Notes in Computer Science; vol 9448).

Palágyi K. Equivalent 2D sequential and parallel thinning. In: Barneva RP, Brimkov V E, ?lapal J, editors. Combinatorial Image Analysis. Brno, Czech Republic: Springer ; 2014. 9. p. 91-100p. 

Nagy A. Smoothing Filters in the DART Algorithm. In: Barneva RP, Brimkov VE, ?lapal J, editors. Combinatorial Image Analysis. May 2014, Brno, Czech Republic: Springer; 2014. 2. p. 224-237p. 

Kardos P, Palágyi K. Sufficient conditions for general 2D operators to preserve topology. In: Barneva RP, Brimkov V E, ?lapal J, editors. Combinatorial Image Analysis. Vol 8466. May 2014, Brno, Czech Republic: Springer; 2014. 1. p. 101-112p.  (LNCS; vol 8466).

Hantos N, Balázs P, Palágyi K. Binary image reconstruction from two projections and skeletal information. In: Barneva RP, Brimkov VE, Aggarwal JK, editors. Combinatorial Image Analysis. Berlin; Heidelberg; New York; London; Paris; Tokyo: Springer Verlag; 2012. 2. p. 263-273p.  (Lecture Notes in Computer Science).

Kardos P, Palágyi K. On topology preservation for triangular thinning algorithms. In: Barneva RP, Brimkov V E, Aggarwal JK, editors. Combinatorial Image Analysis (IWCIA). Austin, TX, USA: Springer Verlag; 2012. 1. p. 128-142p.  (Lecture Notes in Computer Science).

Palágyi K, Németh G, Kardos P. Topology Preserving Parallel 3D Thinning Algorithms. In: Brimkov V E, Barneva RP, editors. Digital Geometry Algorithms. Springer-Verlag; 2012. 1. p. 165-188p.  (Lecture Notes in Computational Vision and Biomechanics).

Németh G, Kardos P, Palágyi K. A family of topology-preserving 3d parallel 6-subiteration thinning algorithms. In: Aggarwal JK, Barneva RP, Brimkov V E, Koroutchev KN, Korutcheva ER, editors. Combinatorial Image Analysis (IWCIA). Madrid, Spain: Springer Verlag; 2011. 1. p. 17-30p.  (Lecture Notes in Computer Science).

Kardos P, Palágyi K. On topology preservation for hexagonal parallel thinning algorithms. In: Aggarwal JK, Barneva RP, Brimkov V E, Koroutchev KN, Korutcheva ER, editors. Combinatorial Image Analysis (IWCIA). Madrid, Spain: Springer Verlag; 2011. 3. p. 31-42p.  (Lecture Notes in Computer Science).

Varga L, Balázs P, Nagy A. Direction-dependency of a binary tomographic reconstruction algorithm. In: Barneva RP, Brimkov VE, Hauptman HA, Jorge R M N, Tavares JManuel RS, editors. Computational Modeling of Objects Represented in Images. Buffalo, NY, USA: Springer Verlag; 2010. 2. p. 242-253p.  (Lecture Notes in Computer Science).

Németh G, Palágyi K. Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation. In: Wiederhold P, Barneva RP, editors. Progress in Combinatorial Image Analysis. Singapore: Scientific Research Publishing Inc.; 2010. 1. p. 183-194p. 

Németh G, Kardos P, Palágyi K. Topology Preserving Parallel Smoothing for 3D Binary Images. In: Barneva RP, Brimkov V E, Hauptman HA, Jorge R M N, Tavares JManuel RS, editors. Proceedings of the Computational Modeling of Objects Represented in Images (CMORI). Vol 6026. Buffalo, USA: Springer Verlag; 2010. 2. p. 287-298p. 

Kardos P, Németh G, Palágyi K. An order-independent sequential thinning algorithm. In: Wiederhold P, Barneva RP, editors. Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA). Playa del Carmen, Mexico: Springer Verlag; 2009. 1. p. 162-175p. 

Balázs P. Reconstruction of canonical hv-convex discrete sets from horizontal and vertical projections. In: Wiederhold P, Barneva RP, editors. Combinatorial Image Analysis. Berlin; Heidelberg; New York; London; Paris; Tokyo: Springer Verlag; 2009. 2. p. 280-288p. 

Balázs P. On the number of hv-convex discrete sets. In: Brimkov VE, Barneva RP, Hauptman HA, editors. Combinatorial Image Analysis. Buffalo, NY, USA: Springer Verlag; 2008. 1. p. 112-123p.  (Lecture Notes in Computer Science).