| Matroid theory and its applications in electric network theory and in statics A Recski Springer Science & Business Media, 2013 | 429 | 2013 |
| A network theory approach to the rigidity of skeletal structures part II. Laman’s theorem and topological formulae A Recski Discrete applied mathematics 8 (1), 63-68, 1984 | 58 | 1984 |
| Algorithms for Asymmetrically Weighted Pair of Disjoint Paths in Survivable Networks. P Laborczi, J Tapolcai, PH Ho, T Cinkler, A Recski, HT Mouftah DRCN, 220-227, 2001 | 37 | 2001 |
| Rigid tensegrity labelings of graphs T Jordán, A Recski, Z Szabadka European Journal of Combinatorics 30 (8), 1887-1895, 2009 | 33 | 2009 |
| On the sum of matroids L Lovász, A Recski Acta Mathematica Hungarica 24 (3-4), 329-333, 1973 | 32 | 1973 |
| The sum of matroids II A Recski, A Recski Matroid Theory and its Applications in Electric Network Theory and in …, 1989 | 27* | 1989 |
| A network theory approach to the rigidity of skeletal structures Part I. Modelling and interconnection A Recski Discrete applied mathematics 7 (3), 313-324, 1984 | 25 | 1984 |
| Network theory and transversal matroids A Recski, M Iri Discrete Applied Mathematics 2 (4), 311-326, 1980 | 24 | 1980 |
| Sufficient conditions for the unique solvability of linear networks containing memoryless 2‐ports A Recski International Journal of Circuit Theory and Applications 8 (2), 95-103, 1980 | 24 | 1980 |
| Unique solvability and order of complexity of linear networks containing memoryless n‐ports A Recski International Journal of Circuit Theory and Applications 7 (1), 31-42, 1979 | 24 | 1979 |
| Applications of combinatorics to statics—rigidity of grids N Radics, A Recski Discrete applied mathematics 123 (1-3), 473-485, 2002 | 21 | 2002 |
| What does duality really mean? M Iri, A Recski International Journal of Circuit Theory and Applications 8 (3), 317-324, 1980 | 21 | 1980 |
| On partitional matroids with applications A Recski Coll. Math. Soc. J. Bolyai 10, 1169-1179, 1973 | 21 | 1973 |
| Bracing cubic grids—a necessary condition A Recski Discrete Mathematics 73 (1-2), 199-206, 1988 | 20 | 1988 |
| Rigidity of square grids with holes Z Gáspár, N Radics, A Recski Computer Assisted Methods in Engineering and Science 6 (3-4), 329-335, 2023 | 18 | 2023 |
| Square grids with long “diagonals” Z Gáspár, N Radics, A Recski Optimization Methods and Software 10 (2), 217-231, 1998 | 16 | 1998 |
| Applications of combinatorics to statics—a second survey A Recski Discrete mathematics 108 (1-3), 183-188, 1992 | 16 | 1992 |
| One-story buildings as tensegrity frameworks N Chakravarty, G Holman, A Recski, S McGuinness Structural Topology 1986 múm 12, 1986 | 15 | 1986 |
| Combinatorial conditions for the rigidity of tensegrity frameworks A Recski Horizons of combinatorics, 163-177, 2008 | 14 | 2008 |
| Minimax results and polynomial algorithms in VLSI routing A Recski Annals of Discrete Mathematics 51, 261-273, 1992 | 14 | 1992 |
| Terminal solvability and the n-port interconnection problem A Recski IEEE International Symposium on Circuits and Systems, 988-991, 1979 | 14 | 1979 |
| Maps of matroids with applications A Recski Discrete mathematics 303 (1-3), 175-185, 2005 | 12 | 2005 |
| Algorithms for asymmetrically weighted pair of disjointed paths in survivable networks J Tapolcai, P Laborczi, PH Ho, T Cinkler, A Recski, HT Mouftah Proc. Third International Workshop on DRCN 2001, 239-249, 2001 | 11 | 2001 |
| Unconstrained multilayer switchbox routing E Boros, A Recski, F Wettl Annals of Operations Research 58 (7), 481-491, 1995 | 11 | 1995 |
| Elementary strong maps of graphic matroids A Recski Graphs and Combinatorics 3 (1), 379-382, 1987 | 11 | 1987 |
| Contributions to the n-port interconnection problem by means of matroids A Recski A. Hajnal and VTS ós (eds), Combinatorics, Colloquia Mathematica Societatis …, 1976 | 11 | 1976 |
| Tensegrity frameworks in one-dimensional space A Recski, O Shai European Journal of Combinatorics 31 (4), 1072-1079, 2010 | 10 | 2010 |
| Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI A Recski, D Szeszlér Discrete applied mathematics 155 (1), 44-52, 2007 | 10 | 2007 |
| Some polynomially solvable subcases of the detailed routing problem in VLSI design A Recski Discrete applied mathematics 115 (1-3), 199-208, 2001 | 10 | 2001 |
| Vertex disjoint channel routing on two layers A Recski, F Strzyzewski Proceedings of the 1st Integer Programming and Combinatorial Optimization …, 1990 | 10 | 1990 |
| Some open problems of matroid theory, suggested by its applications A Recski Coll. Math. Soc. J. Bolyai 40, 311-325, 1982 | 10 | 1982 |
| One-story buildings as tensegrity frameworks III A Recski, W Schwärzler Discrete applied mathematics 39 (2), 137-146, 1992 | 9 | 1992 |
| Matroids and network synthesis A Recski Proc. 1980 European Conf. on Circ. Theory and Design (Warsaw, 1980), 192-197, 1980 | 9 | 1980 |
| Matroid Theory and its Applications, volume 6 of Algorithms and Combinatorics A Recski Springer-Verlag, 1989 | 8 | 1989 |
| On the generalization of the matroid parity and the matroid partition problems, with applications A Recski North-Holland Mathematics Studies 75, 567-573, 1983 | 8 | 1983 |
| On the combinatorial sufficient conditions for linear network solvability A Recski, J Takács International Journal of Circuit Theory and Applications 9 (3), 351-354, 1981 | 8 | 1981 |
| Implementation of VLSI routing algorithms B Golda, B Laczay, ZÁ Mann, C Megyeri, A Recski Intelligent Systems at the Service of Mankind, 349, 2002 | 7 | 2002 |
| 3—Dimensional Single Active Layer Routing A Recski, D Szeszlér Japanese Conference on Discrete and Computational Geometry, 318-329, 2000 | 7 | 2000 |
| Unique solvability of linear memoryless networks-a survey A Recski IEEE transactions on circuits and systems 31 (10), 894-897, 1984 | 7 | 1984 |
| Applications of combinatorics to statics–a survey A Recski Proceedings of the 11th Winter School on Abstract Analysis, [237]-247, 1984 | 7 | 1984 |
| Reflection on the concepts of dual, inverse and adjoint networks M Iri, A Recski Technical Group of Circuits and Systems, Institute of Electronics and …, 1979 | 7 | 1979 |
| Hybrid description and the spectrum of linear multiports A Recski IEEE Transactions on Circuits and Systems II: Express Briefs 66 (9), 1502-1506, 2019 | 6 | 2019 |
| Fast digital signature algorithm based on subgraph isomorphism L Szőllősi, T Marosits, G Fehér, A Recski Cryptology and Network Security: 6th International Conference, CANS 2007 …, 2007 | 6 | 2007 |
| Improving size-bounds for subcases of square-shaped switchbox routing A Recski, G Salamon, D Szeszlér Periodica Polytechnica Electrical Engineering (Archives) 48 (1-2), 55-60, 2004 | 6 | 2004 |
| Some problems of self-dual matroids A Recski Colloquia Societatis Janos Bolyai 37 (19851), 635-648, 1981 | 6 | 1981 |
| An algorithm to determine whether the sum of some graphic matroids is graphic A Recski Coll. Math. Soc. J. Bolyai 25, 647-656, 1981 | 6 | 1981 |
| Matroids and independent state variables A Recski Proceedings of the, 1976 | 6 | 1976 |
| The graphicity of the union of graphic matroids CG Csehi, A Recski European Journal of Combinatorics 50, 38-47, 2015 | 5 | 2015 |
| Engineering applications of matroids-a survey AÁ Recski Matroid Theory and its Applications, 300-321, 2011 | 5 | 2011 |
| Matroids—the engineers’ revenge A Recski Research Trends in Combinatorial Optimization: Bonn 2008, 387-398, 2009 | 5 | 2009 |
| On the generalization of the matroid parity problem A Recski, J Szabó Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge …, 2007 | 5 | 2007 |
| On the complexity of the channel routing problem in the dogleg-free multilayer manhattan model KA Somogyi, A Recski Acta Polytechnica Hungarica 1 (2), 89-97, 2004 | 5 | 2004 |
| Large deviations and perturbations of random walks and random surfaces E Bolthausen, A Balog, GOH Katona, A Recski, D Szász Progress in Mathematics 168 (168), 108-120, 1998 | 5 | 1998 |
| Channel routing in the dogleg-free multilayer Manhattan model A Recski Proc. ECCTD'97, Budapest, 39-43, 1997 | 5 | 1997 |
| A practical remark on the minimal synthesis of resistive n-ports A Recski IEEE Transactions on Circuits and Systems 29 (4), 267-269, 1982 | 4 | 1982 |
| Selected topics of matroid theory and its applications L Lovász, A Recski Proceedings of the 10th Winter School on Abstract Analysis, [171]-185, 1982 | 4 | 1982 |
| Matroids in network theory A Recski Proc. 8th Colloq. Microwave Commun, 1978 | 4 | 1978 |
| Matroidal structure of n-ports A Recski Coll. Math. Soc. J. Bolyai 18, 893-909, 1977 | 4 | 1977 |
| On random partitions A Recski Discrete Mathematics 16 (2), 173-177, 1976 | 4 | 1976 |
| Some recent results on planarity and duality A Recski Graph Theory: Proceedings of a Conference held in Łagów, Poland, February 10 …, 2006 | 3 | 2006 |
| The Evolution of an Idea—Gallai’s Algorithm A Recski, D Szeszlér More Sets, Graphs and Numbers: A Salute to Vera Sós and András Hajnal, 317-328, 2006 | 3 | 2006 |
| One-dimensional synthesis of graphs as tensegrity frameworks A Recski, O Shai Proceedings of the 4th Japanese-Hungarian Symposium on Discrete Mathematics …, 2005 | 3 | 2005 |
| Polynomial time manhattan routing without doglegs-a generalization of gallai's algorithm E Boros, A Recski, T Szkaliczki, F Wettl Computers and artificial intelligence 18 (4), 403-413, 1999 | 3 | 1999 |
| Elementary strong maps of graphic matroids, II A Recski Graphs and Combinatorics 10 (2), 205-206, 1994 | 3 | 1994 |
| Some open problems in matroid theory A Recski Annals of the New York Academy of Sciences 555 (1), 332-334, 1989 | 3 | 1989 |
| 2-layer routing of dense bipartite specifications with vertex disjoint paths and via holes A Recski Inst. für Ökonometrie u. Operations Research, 1989 | 3 | 1989 |
| Statics and electric network theory: a unifying role of matroids A Recski Progress in Combinatorial Optimization, 307-314, 1984 | 3 | 1984 |
| Matroids and terminal solvability A Recski Proc. 7th Internat. Coll. on Microwave Communication, Budapest, 242-245, 1982 | 3 | 1982 |
| Some remarks on the arboricity of the tree-complements A Recski Proceedings of the Faculty of Science of Tokai University 15, 71-74, 1980 | 3 | 1980 |
| On the generalization of the Fibonacci numbers A Recski The Fibonacci Quarterly 13, 315-317, 1975 | 3 | 1975 |
| Interconnection, reciprocity and a hierarchical classification of generalized multiports A Recski, Á Vékássy IEEE Transactions on Circuits and Systems I: Regular Papers 68 (9), 3682-3692, 2021 | 2 | 2021 |
| Matroid duality and voltage-current symmetries A Recski Proc. 8th Japanese-Hungarian Symp. on Discrete Math., Veszprém, 419-425, 2013 | 2 | 2013 |
| Two matroidal families on the edge set of a graph A Recski Discrete mathematics 251 (1-3), 155-162, 2002 | 2 | 2002 |
| Gráfelmélet, algoritmuselmélet és algebra GY Katona, A Recski, C Szabó | 2 | 1997 |
| Combinatorics in electrical engineering and statics A Recski Handbook of combinatorics (vol. 2), 1911-1924, 1996 | 2 | 1996 |
| Local and global inconsistencies in the n‐port interconnection problem A Recski International journal of circuit theory and applications 11 (4), 371-375, 1983 | 2 | 1983 |
| Decompositions of a graphic matroid A Recski | 2 | 1978 |
| ENUMERATING PARTITIONAL MATROIDS. A Recski | 2 | 1974 |
| Can the Genericity Assumption Decrease the Rank of a Matrix? A Recski, Á Vékássy Periodica Polytechnica Electrical Engineering and Computer Science 65 (1), 11-14, 2021 | 1 | 2021 |
| On the Graphicity of the Independence Structure of Linear Active Networks CG Csehi, A Recski Periodica Polytechnica Electrical Engineering and Computer Science 61 (2 …, 2017 | 1 | 2017 |
| Partitioning the bases of the union of matroids CG Csehi, A Recski Discrete Mathematics 340 (4), 691-694, 2017 | 1 | 2017 |
| Matroid union—Graphic? Binary? Neither? CG Csehi, A Recski Discrete Applied Mathematics 209, 75-83, 2016 | 1 | 2016 |
| A New Worst Case Lower Bound for the Width of Single Row Routing in the Unconstrained Two-Layer Model B Drága, A Recski Proc. 6th Internat. Symp. Computational Intelligence, Budapest Tech, 172-176, 2005 | 1 | 2005 |
| Selected Papers-First Japanese-Hungarian Symposium for Discrete Mathematics and its Applications-Kyoto, March 17-19, 1999-Preface N Katoh, T Ibaraki, A Recski DISCRETE APPLIED MATHEMATICS 115 (1-3), 1-1, 2001 | 1 | 2001 |
| Graph theory and combinatorial biology L Lovász (No Title), 1999 | 1 | 1999 |
| Some algorithmic problems of linear network solvability A Recski 1988., IEEE International Symposium on Circuits and Systems, 135-138, 1988 | 1 | 1988 |
| Matroid theory L Lovász, A Recski (No Title), 1985 | 1 | 1985 |
| On the parametrization of linear memoryless 2‐ports A Recski, V Zoller International Journal of Circuit Theory and Applications 10 (1), 57-67, 1982 | 1 | 1982 |
| Synthesis of a Class of Reciprocal-Ports and a Highly Singular Construction A Recski, Á Vékássy IEEE Transactions on Circuits and Systems II: Express Briefs 70 (1), 3-5, 2022 | | 2022 |
| Applications of matroids in electric network theory A Recski Optimization Methods and Software 36 (2-3), 560-568, 2021 | | 2021 |
| An Analogy and Several Symmetries A Recski Complex Symmetries, 95-104, 2021 | | 2021 |
| Generalized matroid matching A Recski, J Szabó Discrete Applied Mathematics 276, 129-133, 2020 | | 2020 |
| Generalization of the Normal Tree Method for Networks Without Graphic Structures A Recski IEEE Transactions on Circuits and Systems II: Express Briefs 67 (10), 1800-1803, 2019 | | 2019 |
| Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications A Frank, A Recski, G Wiener Budapesti Műszaki és Gazdaságtudományi Egyetem, 2017 | | 2017 |
| Some new subclasses of graphic matroids, related to the union operation CG Csehi, A Recski | | 2015 |
| Theoretische Informatik ZÁ Mann, A Recski | | 2008 |
| Kombinatorikus optimalizálás alkalmazásai a villamosságtanban= Combinatorial optimization and its applications in electrical engineering A Recski, D Fogaras, A Frank, K Friedl, P Laborczi, ZÁ Mann, D Marx, ... OTKA Kutatási Jelentések| OTKA Research Reports, 2007 | | 2007 |
| 3-dimensional Routing A Recski, D Szeszlér | | 2007 |
| Az új algoritmusok és kódolási eljárások alkalmazása a mobil hírközlésben és informatikában= Application of new algorithms and coding procedures in mobile communications and … L Pap, F Balázs, B Benkovics, L Buttyán, S Csibi, P Fazekas, D Fogaras, ... OTKA Kutatási Jelentések| OTKA Research Reports, 2007 | | 2007 |
| Kombinatorikus Optimalizálás: Algoritmusok, Strukturák, Alkalmazások= Combinatorial optimization: algorithms, structures, applications A Frank, A Benczúr, Z Fekete, P Fige, T Fleiner, B Fleiner, O Fülöp, ... OTKA Kutatási Jelentések| OTKA Research Reports, 2006 | | 2006 |
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestVerified email at cs.elte.hu
