András Recski

According to our database, András Recski authored at least 36 papers between 1976 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

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

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

Applications of matroids in electric network theory.

András Recski

Optim. Methods Softw., 2021

Can the Genericity Assumption Decrease the Rank of a Matrix?

András Recski, Áron Vékássy

Period. Polytech. Electr. Eng. Comput. Sci., 2021

2020

Generalization of the Normal Tree Method for Networks Without Graphic Structures.

András Recski

IEEE Trans. Circuits Syst. II Express Briefs, 2020

Generalized matroid matching.

András Recski, Jácint Szabó

Discret. Appl. Math., 2020

2019

Hybrid Description and the Spectrum of Linear Multiports.

András Recski

IEEE Trans. Circuits Syst. II Express Briefs, 2019

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

Partitioning the bases of the union of matroids.

Csongor Gy. Csehi, András Recski

Discret. Math., 2017

2016

Matroid union - Graphic? Binary? Neither?

Csongor Gy. Csehi, András Recski

Discret. Appl. Math., 2016

2015

The graphicity of the union of graphic matroids.

Csongor Gy. Csehi, András Recski

Eur. J. Comb., 2015

2010

Tensegrity frameworks in one-dimensional space.

András Recski, Offer Shai

Eur. J. Comb., 2010

2009

Rigid tensegrity labelings of graphs.

Tibor Jordán, András Recski, Zoltan Szabadka

Eur. J. Comb., 2009

2008

Matroids - the Engineers' Revenge.

András Recski

Proceedings of the Research Trends in Combinatorial Optimization, 2008

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

Fast Digital Signature Algorithm Based on Subgraph Isomorphism.

Loránd Szöllösi, Tamás Marosits, Gábor Fehér, András Recski

Proceedings of the Cryptology and Network Security, 6th International Conference, 2007

2005

Maps of matroids with applications.

András Recski

Discret. Math., 2005

2002

Two matroidal families on the edge set of a graph.

András Recski

Discret. Math., 2002

Applications of combinatorics to statics--rigidity of grid.

Norbert Radics, András Recski

Discret. Appl. Math., 2002

2001

Some polynomially solvable subcases of the detailed routing problem in VLSI design.

András Recski

Discret. Appl. Math., 2001

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

Proceedings of the 3rd International Workshop on the Design of Reliable Communication Networks, 2001

2000

VLSI Routing in Polynomial Time.

András Recski

Electron. Notes Discret. Math., 2000

3-Dimensional Single Active Layer Routing.

András Recski, Dávid Szeszlér

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999

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

1995

Unconstrained multilayer switchbox routing.

Endre Boros, András Recski, Ferenc Wettl

Ann. Oper. Res., 1995

1994

Elementary strong maps of graphic matroids, II.

András Recski

Graphs Comb., 1994

1992

Applications of combinatorics to statics - a second survey.

András Recski

Discret. Math., 1992

One-Story Buildings as Tensegrity Frameworks III.

András Recski, Werner Schwärzler

Discret. Appl. Math., 1992

1990

Vertex Disjoint Channel Routing on Two Layers.

András Recski, Frank Strzyzewski

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989

Bracing cubic grids - a necessary condition.

András Recski

Discret. Math., 1989

1987

Elementary strong maps of graphic matroids.

András Recski

Graphs Comb., 1987

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

A network theory approach to the rigidity of skeletal structures Part I. Modelling and interconnection.

András Recski

Discret. Appl. Math., 1984

1981

On the sum of matroids, III.

András Recski

Discret. Math., 1981

1980

Network theory and transversal matroids.

András Recski, Masao Iri

Discret. Appl. Math., 1980

1976

On random partitions.

András Recski

Discret. Math., 1976