Ronald I. Becker

24 papers A* 1B 2C 2Journal 16Unranked 3
YearRankTypeTitle / Venue / Authors
2011 J jnl
Locating median paths on connected outerplanar graphs.
Networks
Isabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker
2011 C conf
Research work with Bruno Simeone.
CTW
Ronald I. Becker
2009 J jnl
Bicolored graph partitioning, or: gerrymandering at its worst.
Discret. Appl. Math.
Nicola Apollonio, Ronald I. Becker, Isabella Lari, Federica Ricca, Bruno Simeone
2008 C conf
Locating Median Paths on Connected Outerplanar Graphs.
CTW
Isabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker
2007 J jnl
Algorithms for central-median paths with bounded length on trees.
Eur. J. Oper. Res.
Ronald I. Becker, Isabella Lari, Andrea Scozzari
2007 J jnl
The location of median paths on grid graphs.
Ann. Oper. Res.
Ronald I. Becker, Isabella Lari, Andrea Scozzari, Giovanni Storchi
2002 J jnl
A shifting algorithm for continuous tree partitioning.
Theor. Comput. Sci.
Ronald I. Becker, Bruno Simeone, Yen-I Chiang
2002 J jnl
Efficient algorithms for finding the (k, l)-core of tree networks.
Networks
Ronald I. Becker, Isabella Lari, Giovanni Storchi, Andrea Scozzari
2002 J jnl
Finding the l-core of a tree.
Discret. Appl. Math.
Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari, Giovanni Storchi
2001 J jnl
A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders.
Theory Comput. Syst.
Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone
2001 B conf
The Cent-dian Path Problem on Tree Networks.
ISAAC
Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari
1998 J jnl
Max-min partitioning of grid graphs into connected components.
Networks
Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone
1998 J jnl
The New Class of g-Chain Periodic Sorters.
J. Parallel Distributed Comput.
Ronald I. Becker, David Nassimi, Yehoshua Perl
1996 J jnl
The errors in FFT estimation of the Fourier transform.
IEEE Trans. Signal Process.
Ronald I. Becker, Norman Morrison
1995 J jnl
The Shifting Algorithm Technique for the Partitioning of Trees.
Discret. Appl. Math.
Ronald I. Becker, Yehoshua Perl
1994 — conf
The Generalized Class of g-Chaln Periodic Sorting Networks.
IPPS
David Nassimi, Yehoshua Perl, Ronald I. Becker
1993 J jnl
A Shifting Algorithm for Constrained min-max Partition on Trees.
Discret. Appl. Math.
Eliezer Agasi, Ronald I. Becker, Yehoshua Perl
1993 B conf
The New Class of g-Chain Periodic Sorters.
SPAA
Ronald I. Becker, David Nassimi, Yehoshua Perl
1985 J jnl
Finding the two-core of a tree.
Discret. Appl. Math.
Ronald I. Becker, Yehoshua Perl
1984 — conf
A Bottom-Up Algorithm for Weight- and Height-Bounded Minimal Partitions of Trees.
CAAP
Ronald I. Becker, Stephen R. Schach
1983 J jnl
Shifting Algorithms for Tree Partitioning with General Weighting Functions.
J. Algorithms
Ronald I. Becker, Yehoshua Perl
1982 J jnl
A Shifting Algorithm for Min-Max Tree Partitioning.
J. ACM
Ronald I. Becker, Stephen R. Schach, Yehoshua Perl
1982 — conf
Drawing labelled directed binary graphs on a grid.
ACM Southeast Regional Conference
Ronald I. Becker, Stephen R. Schach
1980 A* conf
A Shifting Algorithm for Min-Max Tree Partitioning.
ICALP
Ronald I. Becker, Yehoshua Perl, Stephen R. Schach