Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Recski, András - Institute of Mathematics, Eötvös Loránd University
Some polynomially solvable subcases of the detailed routing problem in VLSI design
Applications of combinatorics to statics { rigidity of grids Norbert Radics Andr as Recski
On the generalization of the matroid parity Andr as Recski and J acint Szab o
3{dimensional Single Active Layer Routing Andr as Recski and D avid Szeszl er
Maps of matroids with applications Andr as Recski
Two matroidal families on the edge set of a graph Andr as Recski
Polynomial Time Manhattan Routing without Doglegs a Generalization of Gallai's Algorithm
IMPROVING SIZEBOUNDS FOR SUBCASES OF SQUARESHAPED SWITCHBOX ROUTING
BOLYAI SOCIETY Conference on Finite MATHEMATICAL STUDIES, X and Infinite Sets
Square Grids with Long ''Diagonals'' Zsolt G'asp'ar \Lambda Norbert Radics \Lambda Andr'as Recski \Lambda
One-Dimensional Synthesis of Graphs as Tensegrity Andrs RECSKI
