András Recski

Publication Activity (10 Years)

Years Active: 1976-2023
Publications (10 Years): 11

Top Topics

Nuclear Norm Minimization

Independent Set

Hierarchical Classification

Top Venues

IEEE Trans. Circuits Syst. II Express Briefs

Discret. Appl. Math.

Period. Polytech. Electr. Eng. Comput. Sci.

IEEE Trans. Circuits Syst. I Regul. Pap.

Publications

András Recski, Áron Vékássy
Synthesis of a Class of Reciprocal -Ports and a Highly Singular Construction. IEEE Trans. Circuits Syst. II Express Briefs 70 (1) (2023)
András Recski, Áron Vékássy
Interconnection, Reciprocity and a Hierarchical Classification of Generalized Multiports. IEEE Trans. Circuits Syst. I Regul. Pap. 68 (9) (2021)
András Recski
Applications of matroids in electric network theory. Optim. Methods Softw. 36 (2-3) (2021)
András Recski, Áron Vékássy
Can the Genericity Assumption Decrease the Rank of a Matrix? Period. Polytech. Electr. Eng. Comput. Sci. 65 (1) (2021)
András Recski, Jácint Szabó
Generalized matroid matching. Discret. Appl. Math. 276 (2020)
András Recski
Generalization of the Normal Tree Method for Networks Without Graphic Structures. IEEE Trans. Circuits Syst. II Express Briefs (10) (2020)
András Recski
Hybrid Description and the Spectrum of Linear Multiports. IEEE Trans. Circuits Syst. II Express Briefs (9) (2019)
Csongor Gy. Csehi, András Recski
Partitioning the bases of the union of matroids. Discret. Math. 340 (4) (2017)
Csongor Gy. Csehi, András Recski
On the Graphicity of the Independence Structure of Linear Active Networks. Period. Polytech. Electr. Eng. Comput. Sci. 61 (2) (2017)
Csongor Gy. Csehi, András Recski
Matroid union - Graphic? Binary? Neither? Discret. Appl. Math. 209 (2016)
Csongor Gy. Csehi, András Recski
The graphicity of the union of graphic matroids. Eur. J. Comb. 50 (2015)
András Recski, Offer Shai
Tensegrity frameworks in one-dimensional space. Eur. J. Comb. 31 (4) (2010)
Tibor Jordán, András Recski, Zoltan Szabadka
Rigid tensegrity labelings of graphs. Eur. J. Comb. 30 (8) (2009)
András Recski
Matroids - the Engineers' Revenge. Bonn Workshop of Combinatorial Optimization (2008)
Loránd Szöllösi, Tamás Marosits, Gábor Fehér, András Recski
Fast Digital Signature Algorithm Based on Subgraph Isomorphism. CANS (2007)
András Recski, Dávid Szeszlér
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI. Discret. Appl. Math. 155 (1) (2007)
András Recski
Maps of matroids with applications. Discret. Math. 303 (1-3) (2005)
András Recski
Two matroidal families on the edge set of a graph. Discret. Math. 251 (1-3) (2002)
Norbert Radics, András Recski
Applications of combinatorics to statics--rigidity of grid. Discret. Appl. Math. 123 (1-3) (2002)
Peter Laborczi, János Tapolcai, Pin-Han Ho, Tibor Cinkler, András Recski, Hussein T. Mouftah
Algorithms for Asymmetrically Weighted Pair of Disjoint Paths in Survivable Networks. DRCN (2001)
András Recski
Some polynomially solvable subcases of the detailed routing problem in VLSI design. Discret. Appl. Math. 115 (1-3) (2001)
András Recski, Dávid Szeszlér
3-Dimensional Single Active Layer Routing. JCDCG (2000)
András Recski
VLSI Routing in Polynomial Time. Electron. Notes Discret. Math. 5 (2000)
Endre Boros, András Recski, Tibor Szkaliczki, Ferenc Wettl
Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm. Comput. Artif. Intell. 18 (4) (1999)
Endre Boros, András Recski, Ferenc Wettl
Unconstrained multilayer switchbox routing. Ann. Oper. Res. 58 (7) (1995)
András Recski
Elementary strong maps of graphic matroids, II. Graphs Comb. 10 (2-4) (1994)
András Recski, Werner Schwärzler
One-Story Buildings as Tensegrity Frameworks III. Discret. Appl. Math. 39 (2) (1992)
András Recski
Applications of combinatorics to statics - a second survey. Discret. Math. 108 (1-3) (1992)
András Recski, Frank Strzyzewski
Vertex Disjoint Channel Routing on Two Layers. IPCO (1990)
András Recski
Bracing cubic grids - a necessary condition. Discret. Math. 73 (1-2) (1989)
András Recski
Elementary strong maps of graphic matroids. Graphs Comb. 3 (1) (1987)
András Recski
A network theory approach to the rigidity of skeletal structures part II. Laman's theorem and topological formulae. Discret. Appl. Math. 8 (1) (1984)
András Recski
A network theory approach to the rigidity of skeletal structures Part I. Modelling and interconnection. Discret. Appl. Math. 7 (3) (1984)
András Recski
On the sum of matroids, III. Discret. Math. 36 (3) (1981)
András Recski, Masao Iri
Network theory and transversal matroids. Discret. Appl. Math. 2 (4) (1980)
András Recski
On random partitions. Discret. Math. 16 (2) (1976)