| 2007 |
|---|
| 14 | EE | 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 |
| 13 | EE | András Recski,
Dávid Szeszlér:
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI.
Discrete Applied Mathematics 155(1): 44-52 (2007) |
| 2005 |
|---|
| 12 | EE | András Recski:
Maps of matroids with applications.
Discrete Mathematics 303(1-3): 175-185 (2005) |
| 2002 |
|---|
| 11 | | Norbert Radics,
András Recski:
Applications of combinatorics to statics--rigidity of grid.
Discrete Applied Mathematics 123(1-3): 473-485 (2002) |
| 10 | EE | András Recski:
Two matroidal families on the edge set of a graph.
Discrete Mathematics 251(1-3): 155-162 (2002) |
| 2001 |
|---|
| 9 | | András Recski:
Some polynomially solvable subcases of the detailed routing problem in VLSI design.
Discrete Applied Mathematics 115(1-3): 199-208 (2001) |
| 2000 |
|---|
| 8 | EE | András Recski,
Dávid Szeszlér:
3-Dimensional Single Active Layer Routing.
JCDCG 2000: 318-329 |
| 7 | EE | András Recski:
VLSI Routing in Polynomial Time.
Electronic Notes in Discrete Mathematics 5: 274-277 (2000) |
| 1999 |
|---|
| 6 | | Endre Boros,
András Recski,
Tibor Szkaliczki,
Ferenc Wettl:
Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm.
Computers and Artificial Intelligence 18(4): (1999) |
| 1992 |
|---|
| 5 | EE | András Recski,
Werner Schwärzler:
One-Story Buildings as Tensegrity Frameworks III.
Discrete Applied Mathematics 39(2): 137-146 (1992) |
| 4 | EE | András Recski:
Applications of combinatorics to statics - a second survey.
Discrete Mathematics 108(1-3): 183-188 (1992) |
| 1990 |
|---|
| 3 | | András Recski,
Frank Strzyzewski:
Vertex Disjoint Channel Routing on Two Layers.
IPCO 1990: 397-405 |
| 1989 |
|---|
| 2 | EE | András Recski:
Bracing cubic grids - a necessary condition.
Discrete Mathematics 73(1-2): 199-206 (1989) |
| 1981 |
|---|
| 1 | EE | András Recski:
On the sum of matroids, III.
Discrete Mathematics 36(3): 273-287 (1981) |
