Zs. Gáspár, N Radics and A. Recski: Square grids with long diagonals,

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.

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.

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

109. A. Recski and D. Szeszlér: Routing vertex-disjoint Steiner
trees in a cubic grid: an application in VLSI, in preparation.