On random partitions. - András Recski (Discret. Math., 1976)

Network theory and transversal matroids. - András Recski; Masao Iri (Discret. Appl. Math., 1980)

On the sum of matroids, III. - András Recski (Discret. Math., 1981)

A network theory approach to the rigidity of skeletal structures Part I. Modelling and interconnection. - András Recski (Discret. Appl. Math., 1984)

A network theory approach to the rigidity of skeletal structures part II. Laman's theorem and topological formulae. - András Recski (Discret. Appl. Math., 1984)

Elementary strong maps of graphic matroids. - András Recski (Graphs Comb., 1987)

Bracing cubic grids - a necessary condition. - András Recski (Discret. Math., 1989)

Vertex Disjoint Channel Routing on Two Layers. - András Recski; Frank Strzyzewski (IPCO, 1990)

One-Story Buildings as Tensegrity Frameworks III. - András Recski; Werner Schwärzler (Discret. Appl. Math., 1992)

Applications of combinatorics to statics - a second survey. - András Recski (Discret. Math., 1992)

Elementary strong maps of graphic matroids, II. - András Recski (Graphs Comb., 1994)

Unconstrained multilayer switchbox routing. - Endre Boros; András Recski; Ferenc Wettl (Ann. Oper. Res., 1995)

Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm. - Endre Boros; András Recski; Tibor Szkaliczki; Ferenc Wettl (Comput. Artif. Intell., 1999)

3-Dimensional Single Active Layer Routing. - András Recski; Dávid Szeszlér (JCDCG, 2000)

VLSI Routing in Polynomial Time. - András Recski (Electron. Notes Discret. Math., 2000)

Algorithms for Asymmetrically Weighted Pair of Disjoint Paths in Survivable Networks. - Peter Laborczi; János Tapolcai; Pin-Han Ho; Tibor Cinkler; András Recski; Hussein T. Mouftah (DRCN, 2001)

Some polynomially solvable subcases of the detailed routing problem in VLSI design. - András Recski (Discret. Appl. Math., 2001)

Applications of combinatorics to statics–rigidity of grid. - Norbert Radics; András Recski (Discret. Appl. Math., 2002)

Two matroidal families on the edge set of a graph. - András Recski (Discret. Math., 2002)

Maps of matroids with applications. - András Recski (Discret. Math., 2005)

Fast Digital Signature Algorithm Based on Subgraph Isomorphism. - Loránd Szöllösi; Tamás Marosits; Gábor Fehér; András Recski (CANS, 2007)

Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI. - András Recski; Dávid Szeszlér (Discret. Appl. Math., 2007)

Matroids - the Engineers' Revenge. - András Recski (Bonn Workshop of Combinatorial Optimization, 2008)

Rigid tensegrity labelings of graphs. - Tibor Jordán; András Recski; Zoltan Szabadka (Eur. J. Comb., 2009)

Tensegrity frameworks in one-dimensional space. - András Recski; Offer Shai (Eur. J. Comb., 2010)

The graphicity of the union of graphic matroids. - Csongor Gy. Csehi; András Recski (Eur. J. Comb., 2015)

Matroid union - Graphic? Binary? Neither? - Csongor Gy. Csehi; András Recski (Discret. Appl. Math., 2016)

Partitioning the bases of the union of matroids. - Csongor Gy. Csehi; András Recski (Discret. Math., 2017)

On the Graphicity of the Independence Structure of Linear Active Networks. - Csongor Gy. Csehi; András Recski (Period. Polytech. Electr. Eng. Comput. Sci., 2017)

Hybrid Description and the Spectrum of Linear Multiports. - András Recski (IEEE Trans. Circuits Syst. II Express Briefs, 2019)

Generalized matroid matching. - András Recski; Jácint Szabó (Discret. Appl. Math., 2020)

Generalization of the Normal Tree Method for Networks Without Graphic Structures. - András Recski (IEEE Trans. Circuits Syst. II Express Briefs, 2020)

Can the Genericity Assumption Decrease the Rank of a Matrix? - András Recski; Áron Vékássy (Period. Polytech. Electr. Eng. Comput. Sci., 2021)

Applications of matroids in electric network theory. - András Recski (Optim. Methods Softw., 2021)

Interconnection, Reciprocity and a Hierarchical Classification of Generalized Multiports. - András Recski; Áron Vékássy (IEEE Trans. Circuits Syst. I Regul. Pap., 2021)

Synthesis of a Class of Reciprocal -Ports and a Highly Singular Construction. - András Recski; Áron Vékássy (IEEE Trans. Circuits Syst. II Express Briefs, 2023)