 | 2011 |
|---|
| 23 |       | Ronald I. Becker:
Research work with Bruno Simeone.
CTW 2011: 1-3 |
| 22 | | Isabella Lari,
Federica Ricca,
Andrea Scozzari,
Ronald I. Becker:
Locating median paths on connected outerplanar graphs.
Networks 57(3): 294-307 (2011) |
| 2009 |
|---|
| 21 | | Nicola Apollonio,
Ronald I. Becker,
Isabella Lari,
Federica Ricca,
Bruno Simeone:
Bicolored graph partitioning, or: gerrymandering at its worst.
Discrete Applied Mathematics 157(17): 3601-3614 (2009) |
| 2008 |
|---|
| 20 |  | Isabella Lari,
Federica Ricca,
Andrea Scozzari,
Ronald I. Becker:
Locating Median Paths on Connected Outerplanar Graphs.
CTW 2008: 186-188 |
| 2007 |
|---|
| 19 | | Ronald I. Becker,
Isabella Lari,
Andrea Scozzari,
Giovanni Storchi:
The location of median paths on grid graphs.
Annals OR 150(1): 65-78 (2007) |
| 18 | | Ronald I. Becker,
Isabella Lari,
Andrea Scozzari:
Algorithms for central-median paths with bounded length on trees.
European Journal of Operational Research 179(3): 1208-1220 (2007) |
| 2002 |
|---|
| 17 | | Ronald I. Becker,
Yen-I Chiang,
Isabella Lari,
Andrea Scozzari,
Giovanni Storchi:
Finding the l-core of a tree.
Discrete Applied Mathematics 118(1-2): 25-42 (2002) |
| 16 | | Ronald I. Becker,
Isabella Lari,
Giovanni Storchi,
Andrea Scozzari:
Efficient algorithms for finding the (k, l)-core of tree networks.
Networks 40(4): 208-215 (2002) |
| 15 | | Ronald I. Becker,
Bruno Simeone,
Yen-I Chiang:
A shifting algorithm for continuous tree partitioning.
Theor. Comput. Sci. 282(2): 353-380 (2002) |
| 2001 |
|---|
| 14 | | Ronald I. Becker,
Yen-I Chiang,
Isabella Lari,
Andrea Scozzari:
The Cent-dian Path Problem on Tree Networks.
ISAAC 2001: 743-755 |
| 13 | | Ronald I. Becker,
Isabella Lari,
Mario Lucertini,
Bruno Simeone:
A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders.
Theory Comput. Syst. 34(4): 353-374 (2001) |
| 1998 |
|---|
| 12 | | Ronald I. Becker,
David Nassimi,
Yehoshua Perl:
The New Class of g-Chain Periodic Sorters.
J. Parallel Distrib. Comput. 54(2): 206-222 (1998) |
| 11 | | Ronald I. Becker,
Isabella Lari,
Mario Lucertini,
Bruno Simeone:
Max-min partitioning of grid graphs into connected components.
Networks 32(2): 115-125 (1998) |
| 1996 |
|---|
| 10 | | Ronald I. Becker,
Norman Morrison:
The errors in FFT estimation of the Fourier transform.
IEEE Transactions on Signal Processing 44(8): 2073-2077 (1996) |
| 1995 |
|---|
| 9 | | Ronald I. Becker,
Yehoshua Perl:
The Shifting Algorithm Technique for the Partitioning of Trees.
Discrete Applied Mathematics 62(1-3): 15-34 (1995) |
| 1994 |
|---|
| 8 | | David Nassimi,
Yehoshua Perl,
Ronald I. Becker:
The Generalized Class of g-Chaln Periodic Sorting Networks.
IPPS 1994: 424-432 |
| 1993 |
|---|
| 7 | | Ronald I. Becker,
David Nassimi,
Yehoshua Perl:
The New Class of g-Chain Periodic Sorters.
SPAA 1993: 356-364 |
| 6 | | Eliezer Agasi,
Ronald I. Becker,
Yehoshua Perl:
A Shifting Algorithm for Constrained min-max Partition on Trees.
Discrete Applied Mathematics 45(1): 1-28 (1993) |
| 1984 |
|---|
| 5 | | Ronald I. Becker,
Stephen R. Schach:
A Bottom-Up Algorithm for Weight- and Height-Bounded Minimal Partitions of Trees.
CAAP 1984: 63-72 |
| 1983 |
|---|
| 4 | | Ronald I. Becker,
Yehoshua Perl:
Shifting Algorithms for Tree Partitioning with General Weighting Functions.
J. Algorithms 4(2): 101-120 (1983) |
| 1982 |
|---|
| 3 | | Ronald I. Becker,
Stephen R. Schach:
Drawing labelled directed binary graphs on a grid.
ACM Southeast Regional Conference 1982: 30-34 |
| 2 | | Ronald I. Becker,
Stephen R. Schach,
Yehoshua Perl:
A Shifting Algorithm for Min-Max Tree Partitioning.
J. ACM 29(1): 58-67 (1982) |
| 1980 |
|---|
| 1 | | Ronald I. Becker,
Yehoshua Perl,
Stephen R. Schach:
A Shifting Algorithm for Min-Max Tree Partitioning.
ICALP 1980: 64-75 |
Data released under the ODC-BY 1.0 license — See also our legal information page