Search the dblp DataBase

Publications of Author

1. András Recski, Frank Strzyzewski
   Vertex Disjoint Channel Routing on Two Layers. [Citation Graph (0, 0)][DBLP]
   IPCO, 1990, pp:397-405 [Conf]
   
2. András Recski, Dávid Szeszlér
   3-Dimensional Single Active Layer Routing. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2000, pp:318-329 [Conf]
   
3. Endre Boros, András Recski, Tibor Szkaliczki, Ferenc Wettl
   Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm. [Citation Graph (0, 0)][DBLP]
   Computers and Artificial Intelligence, 1999, v:18, n:4, pp:- [Journal]
   
4. Norbert Radics, András Recski
   Applications of combinatorics to statics--rigidity of grid. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:473-485 [Journal]
   
5. András Recski
   Some polynomially solvable subcases of the detailed routing problem in VLSI design. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:199-208 [Journal]
   
6. András Recski, Werner Schwärzler
   One-Story Buildings as Tensegrity Frameworks III. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1992, v:39, n:2, pp:137-146 [Journal]
   
7. András Recski, Dávid Szeszlér
   Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:1, pp:44-52 [Journal]
   
8. András Recski
   Two matroidal families on the edge set of a graph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:251, n:1-3, pp:155-162 [Journal]
   
9. András Recski
   Maps of matroids with applications. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:303, n:1-3, pp:175-185 [Journal]
   
10. Loránd Szöllösi, Tamás Marosits, Gábor Fehér, András Recski
    Fast Digital Signature Algorithm Based on Subgraph Isomorphism. [Citation Graph (0, 0)][DBLP]
    CANS, 2007, pp:34-46 [Conf]
    
11. András Recski
    On the sum of matroids, III. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:36, n:3, pp:273-287 [Journal]
    
12. András Recski
    Bracing cubic grids - a necessary condition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:199-206 [Journal]
    
13. András Recski
    Applications of combinatorics to statics - a second survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:183-188 [Journal]
    
14. 
    Tensegrity frameworks in one-dimensional space. [Citation Graph (, )][DBLP]
    
    
15. 
    Rigid tensegrity labelings of graphs. [Citation Graph (, )][DBLP]