Person:226827: Difference between revisions

From MaRDI portal
Person:226827
Created automatically from import231006081045
 
m AuthorDisambiguator moved page András Recski to András Recski: Duplicate
 
(No difference)

Latest revision as of 14:05, 9 December 2023

Available identifiers

zbMath Open recski.andrasWikidataQ96626906 ScholiaQ96626906MaRDI QIDQ226827

List of research outcomes





PublicationDate of PublicationType
An Analogy and Several Symmetries2022-11-18Paper
Applications of matroids in electric network theory2021-07-06Paper
Generalized matroid matching2020-04-01Paper
Matroids—the Engineers’ Revenge2017-04-07Paper
Partitioning the bases of the union of matroids2017-02-06Paper
https://portal.mardi4nfdi.de/entity/Q28161352016-07-01Paper
Matroid union -- graphic? binary? neither?2016-06-21Paper
The graphicity of the union of graphic matroids2015-08-19Paper
Engineering Applications of Matroids - A Survey2015-01-07Paper
https://portal.mardi4nfdi.de/entity/Q31099452012-01-26Paper
Tensegrity frameworks in one-dimensional space2010-05-28Paper
Rigid tensegrity labelings of graphs2009-12-03Paper
https://portal.mardi4nfdi.de/entity/Q35394172008-11-18Paper
https://portal.mardi4nfdi.de/entity/Q35094052008-07-01Paper
Fast Digital Signature Algorithm Based on Subgraph Isomorphism2008-04-15Paper
https://portal.mardi4nfdi.de/entity/Q34247912007-03-05Paper
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI2007-01-09Paper
https://portal.mardi4nfdi.de/entity/Q54778212006-06-29Paper
Maps of matroids with applications2005-12-29Paper
Applications of combinatorics to statics -- rigidity of grids2002-09-17Paper
Two matroidal families on the edge set of a graph2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45478202002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q45295722002-05-05Paper
https://portal.mardi4nfdi.de/entity/Q44956342001-01-18Paper
Some polynomially solvable subcases of the detailed routing problem in VLSI design2001-01-01Paper
Square grids with long “diagonals”2000-08-23Paper
https://portal.mardi4nfdi.de/entity/Q42333431999-03-16Paper
https://portal.mardi4nfdi.de/entity/Q48717841999-01-10Paper
Unconstrained multilayer switchbox routing1996-02-01Paper
Elementary strong maps of graphic matroids. II1994-09-26Paper
Matroid theory and its applications in electric network theory and in statics1993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40271901993-02-21Paper
One-story buildings as tensegrity frameworks. III1993-01-17Paper
Applications of combinatorics to statics --- a second survey1993-01-17Paper
https://portal.mardi4nfdi.de/entity/Q40003911992-09-18Paper
https://portal.mardi4nfdi.de/entity/Q39869371992-06-28Paper
Bracing cubic grids - a necessary condition1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32113121989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42079141988-01-01Paper
Elementary strong maps of graphic matroids1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37280101985-01-01Paper
A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection1984-01-01Paper
A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33227391984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33277631984-01-01Paper
Unique solvability of linear memoryless networks-A survey1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808451984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36970221984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33155231983-01-01Paper
Local and global inconsistencies in then-port interconnection problem1983-01-01Paper
On the Generalization of the Matroid Parity and the Matroid Partition Problems, With Applications1983-01-01Paper
On the parametrization of linear memoryless 2-ports1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47481661982-01-01Paper
On the sum of matroids. III1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39272681981-01-01Paper
Network theory and transversal matroids1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38645601980-01-01Paper
Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports1980-01-01Paper
What does duality really mean?1980-01-01Paper
Unique solvability and order of complexity of linear networks containing memorylessn-ports1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38889931978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41752991978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41824421978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41824431978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41905621977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41984471977-01-01Paper
On random partitions1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41018371976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40609761975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40631671975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40780991975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41905611975-01-01Paper
On the sum of matroids1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56596351972-01-01Paper

Research outcomes over time

This page was built for person: András Recski