András Recski - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2023

Synthesis of a Class of Reciprocal -Ports and a Highly Singular ConstructionAndrás Recski, Áron Vékássy. tcasII, 70(1):3-5, 2023. [doi]

2021

Applications of matroids in electric network theoryAndrás Recski. oms, 36(2-3):560-568, 2021. [doi]

Can the Genericity Assumption Decrease the Rank of a Matrix?András Recski, Áron Vékássy. eecs, 65(1):11-14, 2021. [doi]

Interconnection, Reciprocity and a Hierarchical Classification of Generalized MultiportsAndrás Recski, Áron Vékássy. tcasI, 68(9):3682-3692, 2021. [doi]

2020

Generalized matroid matchingAndrás Recski, Jácint Szabó. DAM, 276:129-133, 2020. [doi]

Generalization of the Normal Tree Method for Networks Without Graphic StructuresAndrás Recski. tcas, 67-II(10):1800-1803, 2020. [doi]

2019

Hybrid Description and the Spectrum of Linear MultiportsAndrás Recski. tcas, 66-II(9):1502-1506, 2019. [doi]

2017

Partitioning the bases of the union of matroidsCsongor Gy. Csehi, András Recski. DM, 340(4):691-694, 2017. [doi]

On the Graphicity of the Independence Structure of Linear Active NetworksCsongor Gy. Csehi, András Recski. eecs, 61(2):193-197, 2017. [doi]

2016

Matroid union - Graphic? Binary? Neither?Csongor Gy. Csehi, András Recski. DAM, 209:75-83, 2016. [doi]

2015

The graphicity of the union of graphic matroidsCsongor Gy. Csehi, András Recski. ejc, 50:38-47, 2015. [doi]

2010

Tensegrity frameworks in one-dimensional spaceAndrás Recski, Offer Shai. ejc, 31(4):1072-1079, 2010. [doi]

2009

Rigid tensegrity labelings of graphsTibor Jordán, András Recski, Zoltan Szabadka. ejc, 30(8):1887-1895, 2009. [doi]

2008

Matroids - the Engineers' RevengeAndrás Recski. bonnco 2009: 387-398 [doi]

2007

Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSIAndrás Recski, Dávid Szeszlér. DAM, 155(1):44-52, 2007. [doi]

Fast Digital Signature Algorithm Based on Subgraph IsomorphismLoránd Szöllösi, Tamás Marosits, Gábor Fehér, András Recski. cans 2007: 34-46 [doi]

2005

Maps of matroids with applicationsAndrás Recski. DM, 303(1-3):175-185, 2005. [doi]

2002

Applications of combinatorics to statics--rigidity of gridNorbert Radics, András Recski. DAM, 123(1-3):473-485, 2002.

Two matroidal families on the edge set of a graphAndrás Recski. DM, 251(1-3):155-162, 2002. [doi]

2001

Algorithms for Asymmetrically Weighted Pair of Disjoint Paths in Survivable NetworksPeter Laborczi, János Tapolcai, Pin-Han Ho, Tibor Cinkler, András Recski, Hussein T. Mouftah. drcn 2001: 220-227

Some polynomially solvable subcases of the detailed routing problem in VLSI designAndrás Recski. DAM, 115(1-3):199-208, 2001.

2000

3-Dimensional Single Active Layer RoutingAndrás Recski, Dávid Szeszlér. jcdcg 2001: 318-329 [doi]

VLSI Routing in Polynomial TimeAndrás Recski. endm, 5:274-277, 2000. [doi]

1999

Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's AlgorithmEndre Boros, András Recski, Tibor Szkaliczki, Ferenc Wettl. cai, 18(4):403-413, 1999.

1995

Unconstrained multilayer switchbox routingEndre Boros, András Recski, Ferenc Wettl. anor, 58(7):481-491, 1995. [doi]

1994

Elementary strong maps of graphic matroids, IIAndrás Recski. gc, 10(2-4):205-206, 1994. [doi]

1992

One-Story Buildings as Tensegrity Frameworks IIIAndrás Recski, Werner Schwärzler. DAM, 39(2):137-146, 1992. [doi]

Applications of combinatorics to statics - a second surveyAndrás Recski. DM, 108(1-3):183-188, 1992. [doi]

1990

Vertex Disjoint Channel Routing on Two LayersAndrás Recski, Frank Strzyzewski. ipco 1990: 397-405

1989

Bracing cubic grids - a necessary conditionAndrás Recski. DM, 73(1-2):199-206, 1989. [doi]

1987

Elementary strong maps of graphic matroidsAndrás Recski. gc, 3(1):379-382, 1987. [doi]

1984

A network theory approach to the rigidity of skeletal structures Part I. Modelling and interconnectionAndrás Recski. DAM, 7(3):313-324, 1984. [doi]

A network theory approach to the rigidity of skeletal structures part II. Laman's theorem and topological formulaeAndrás Recski. DAM, 8(1):63-68, 1984. [doi]

1981

On the sum of matroids, IIIAndrás Recski. DM, 36(3):273-287, 1981. [doi]

1980

Network theory and transversal matroidsAndrás Recski, Masao Iri. DAM, 2(4):311-326, 1980. [doi]

1976

On random partitionsAndrás Recski. DM, 16(2):173-177, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL