Ronald I. Becker

According to our database, Ronald I. Becker authored at least 21 papers between 1980 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Research work with Bruno Simeone.

Ronald I. Becker

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2009

Bicolored graph partitioning, or: gerrymandering at its worst.

Nicola Apollonio, Ronald I. Becker, Isabella Lari, Federica Ricca, Bruno Simeone

Discret. Appl. Math., 2009

2008

Locating Median Paths on Connected Outerplanar Graphs.

Isabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

Algorithms for central-median paths with bounded length on trees.

Ronald I. Becker, Isabella Lari, Andrea Scozzari

Eur. J. Oper. Res., 2007

The location of median paths on grid graphs.

Ronald I. Becker, Isabella Lari, Andrea Scozzari, Giovanni Storchi

Ann. Oper. Res., 2007

2002

A shifting algorithm for continuous tree partitioning.

Ronald I. Becker, Bruno Simeone, Yen-I Chiang

Theor. Comput. Sci., 2002

Efficient algorithms for finding the (k, l)-core of tree networks.

Ronald I. Becker, Isabella Lari, Giovanni Storchi, Andrea Scozzari

Networks, 2002

Finding the l-core of a tree.

Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari, Giovanni Storchi

Discret. Appl. Math., 2002

2001

A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders.

Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone

Theory Comput. Syst., 2001

The Cent-dian Path Problem on Tree Networks.

Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1998

Max-min partitioning of grid graphs into connected components.

Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone

Networks, 1998

1996

The errors in FFT estimation of the Fourier transform.

Ronald I. Becker, Norman Morrison

IEEE Trans. Signal Process., 1996

1995

The Shifting Algorithm Technique for the Partitioning of Trees.

Ronald I. Becker, Yehoshua Perl

Discret. Appl. Math., 1995

1994

The Generalized Class of g-Chaln Periodic Sorting Networks.

David Nassimi, Yehoshua Perl, Ronald I. Becker

Proceedings of the 8th International Symposium on Parallel Processing, 1994

1993

A Shifting Algorithm for Constrained min-max Partition on Trees.

Eliezer Agasi, Ronald I. Becker, Yehoshua Perl

Discret. Appl. Math., 1993

The New Class of g-Chain Periodic Sorters.

Ronald I. Becker, David Nassimi, Yehoshua Perl

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1985

Finding the two-core of a tree.

Ronald I. Becker, Yehoshua Perl

Discret. Appl. Math., 1985

1984

A Bottom-Up Algorithm for Weight- and Height-Bounded Minimal Partitions of Trees.

Ronald I. Becker, Stephen R. Schach

Proceedings of the CAAP'84, 1984

1983

Shifting Algorithms for Tree Partitioning with General Weighting Functions.

Ronald I. Becker, Yehoshua Perl

J. Algorithms, 1983

1982

Drawing labelled directed binary graphs on a grid.

Ronald I. Becker, Stephen R. Schach

Proceedings of the 20th Annual Southeast Regional Conference, 1982

1980

A Shifting Algorithm for Min-Max Tree Partitioning.

Ronald I. Becker, Yehoshua Perl, Stephen R. Schach

Proceedings of the Automata, 1980