82.
Zs. Gáspár, N Radics and A. Recski:
Square grids with long diagonals, Optimization Methods and Software,
10. (1998) 217-231
87.
E. Boros, A. Recski, T. Szkaliczki and F. Wettl:
Polynomial time Manhattan routing without doglegs - a generalization of
Gallai's algorithm, Computers and Artificial Intelligence, 18 (1999)
403-413.
89.
A. Recski and D. Szeszlér: 3-dimensional
single active layer routing, in J. Akiyama, M. Kano and M. Urabe (eds.):
Discrete
and Computational Geometry, Lecture Notes in Computer Science, Springer,
Vol. 2098. 2000, 318-329.
93.
A. Recski: Some polynomially solvable subcases
of the detailed routing problem in VLSI design,Discrete Applied
Math. 115 (2001) 199-208.
96.
A. Recski: Two matroidal families on the edge set
of a graph, Discrete Math. 251 (2002) 155-162.
97.
N. Radics and A. Recski: Applications of combinatorics
to statics - rigidity of grids, Discrete Applied Math. 123 (2002)
473-485.
100.
A. Recski, G. Salamon and D. Szeszlér: Improving
size-bounds for subcases of square-shaped switchbox routing, Periodica
Polytechnica 48 (2004) 55-60.
104.
A. Recski and O. Shai: One-dimensional synthesis
of graphs as tensegrity frameworks, 4th Japanese-Hungarian Symposium
on Discrete Mathematics and its Applications,Budapest, 2005, 284-288.
105.
A. Recski: Maps of matroids with applications,
Discrete
Math. in print
106.
A. Recski and D. Szeszlér: The evolution
of an idea - Gallai's algorithm, Bolyai Society Mathematical Studies
in print
107.
A. Recski and J. Szabó: On the generalization
of the matroid parity problem, in J. A. Bondy, J. Fonlupt, J. L. Fouquet,
J.-C. Fournier and J. Ramirez Alfonsin (eds.)
Graph Theeory 2004,
Birkhauser, 2005, in print
109. A. Recski and D. Szeszlér: Routing vertex-disjoint Steiner
trees in a cubic grid: an application in VLSI, in preparation.