default search action
András Recski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j31]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): 3-5 (2023) - 2021
- [j30]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): 11-14 (2021) - [j29]András Recski:
Applications of matroids in electric network theory. Optim. Methods Softw. 36(2-3): 560-568 (2021) - [j28]András Recski
Interconnection, Reciprocity and a Hierarchical Classification of Generalized Multiports. IEEE Trans. Circuits Syst. I Regul. Pap. 68(9): 3682-3692 (2021) - 2020
- [j27]András Recski, Jácint Szabó:
Generalized matroid matching. Discret. Appl. Math. 276: 129-133 (2020) - [j26]András Recski
Generalization of the Normal Tree Method for Networks Without Graphic Structures. IEEE Trans. Circuits Syst. II Express Briefs 67-II(10): 1800-1803 (2020) - 2019
- [j25]András Recski
Hybrid Description and the Spectrum of Linear Multiports. IEEE Trans. Circuits Syst. II Express Briefs 66-II(9): 1502-1506 (2019) - 2017
- [j24]Csongor Gy. Csehi, András Recski
Partitioning the bases of the union of matroids. Discret. Math. 340(4): 691-694 (2017) - [j23]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): 193-197 (2017) - 2016
- [j22]Csongor Gy. Csehi, András Recski:
Matroid union - Graphic? Binary? Neither? Discret. Appl. Math. 209: 75-83 (2016) - 2015
- [j21]Csongor Gy. Csehi, András Recski:
The graphicity of the union of graphic matroids. Eur. J. Comb. 50: 38-47 (2015) - 2010
- [j20]András Recski, Offer Shai:
Tensegrity frameworks in one-dimensional space. Eur. J. Comb. 31(4): 1072-1079 (2010) - 2009
- [j19]Tibor Jordán, András Recski, Zoltan Szabadka:
Rigid tensegrity labelings of graphs. Eur. J. Comb. 30(8): 1887-1895 (2009) - 2007
- [j18]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): 44-52 (2007) - 2005
- [j17]András Recski:
Maps of matroids with applications. Discret. Math. 303(1-3): 175-185 (2005) - 2002
- [j16]Norbert Radics, András Recski:
Applications of combinatorics to statics--rigidity of grid. Discret. Appl. Math. 123(1-3): 473-485 (2002) - [j15]András Recski:
Two matroidal families on the edge set of a graph. Discret. Math. 251(1-3): 155-162 (2002) - 2001
- [j14]András Recski:
Some polynomially solvable subcases of the detailed routing problem in VLSI design. Discret. Appl. Math. 115(1-3): 199-208 (2001) - 2000
- [j13]András Recski:
VLSI Routing in Polynomial Time. Electron. Notes Discret. Math. 5: 274-277 (2000) - 1999
- [j12]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): 403-413 (1999) - 1995
- [j11]Endre Boros
Unconstrained multilayer switchbox routing. Ann. Oper. Res. 58(7): 481-491 (1995) - 1994
- [j10]András Recski:
Elementary strong maps of graphic matroids, II. Graphs Comb. 10(2-4): 205-206 (1994) - 1992
- [j9]András Recski, Werner Schwärzler:
One-Story Buildings as Tensegrity Frameworks III. Discret. Appl. Math. 39(2): 137-146 (1992) - [j8]András Recski:
Applications of combinatorics to statics - a second survey. Discret. Math. 108(1-3): 183-188 (1992) - 1989
- [j7]András Recski:
Bracing cubic grids - a necessary condition. Discret. Math. 73(1-2): 199-206 (1989) - 1987
- [j6]András Recski:
Elementary strong maps of graphic matroids. Graphs Comb. 3(1): 379-382 (1987) - 1984
- [j5]András Recski:
A network theory approach to the rigidity of skeletal structures Part I. Modelling and interconnection. Discret. Appl. Math. 7(3): 313-324 (1984) - [j4]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): 63-68 (1984) - 1981
- [j3]András Recski:
On the sum of matroids, III. Discret. Math. 36(3): 273-287 (1981) - 1980
- [j2]András Recski, Masao Iri:
Network theory and transversal matroids. Discret. Appl. Math. 2(4): 311-326 (1980) - 1976
- [j1]András Recski:
On random partitions. Discret. Math. 16(2): 173-177 (1976)
Conference and Workshop Papers
- 2008
- [c5]András Recski:
Matroids - the Engineers' Revenge. Bonn Workshop of Combinatorial Optimization 2008: 387-398 - 2007
- [c4]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: 34-46 - 2001
- [c3]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: 220-227 - 2000
- [c2]András Recski, Dávid Szeszlér:
3-Dimensional Single Active Layer Routing. JCDCG 2000: 318-329 - 1990
- [c1]András Recski, Frank Strzyzewski:
Vertex Disjoint Channel Routing on Two Layers. IPCO 1990: 397-405
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: