Ronald I. Becker - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2011

Research work with Bruno SimeoneRonald I. Becker. colognetwente 2011: 1-3 [doi]

Locating median paths on connected outerplanar graphsIsabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker. networks, 57(3):294-307, 2011. [doi]

2009

Bicolored graph partitioning, or: gerrymandering at its worstNicola Apollonio, Ronald I. Becker, Isabella Lari, Federica Ricca, Bruno Simeone. DAM, 157(17):3601-3614, 2009. [doi]

2008

Locating Median Paths on Connected Outerplanar GraphsIsabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker. colognetwente 2008: 186-188

2007

Algorithms for central-median paths with bounded length on treesRonald I. Becker, Isabella Lari, Andrea Scozzari. eor, 179(3):1208-1220, 2007. [doi]

The location of median paths on grid graphsRonald I. Becker, Isabella Lari, Andrea Scozzari, Giovanni Storchi. anor, 150(1):65-78, 2007. [doi]

2002

A shifting algorithm for continuous tree partitioningRonald I. Becker, Bruno Simeone, Yen-I Chiang. TCS, 282(2):353-380, 2002. [doi]

Efficient algorithms for finding the (k, l)-core of tree networksRonald I. Becker, Isabella Lari, Giovanni Storchi, Andrea Scozzari. networks, 40(4):208-215, 2002. [doi]

Finding the l-core of a treeRonald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari, Giovanni Storchi. DAM, 118(1-2):25-42, 2002.

2001

A Polynomial-Time Algorithm for Max-Min Partitioning of LaddersRonald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone. mst, 34(4):353-374, 2001. [doi]

The Cent-dian Path Problem on Tree NetworksRonald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari. isaac 2001: 743-755 [doi]

1998

Max-min partitioning of grid graphs into connected componentsRonald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone. networks, 32(2):115-125, 1998. [doi]

The New Class of g-Chain Periodic SortersRonald I. Becker, David Nassimi, Yehoshua Perl. jpdc, 54(2):206-222, 1998.

1996

The errors in FFT estimation of the Fourier transformRonald I. Becker, Norman Morrison. tsp, 44(8):2073-2077, 1996. [doi]

1995

The Shifting Algorithm Technique for the Partitioning of TreesRonald I. Becker, Yehoshua Perl. DAM, 62(1-3):15-34, 1995. [doi]

1994

The Generalized Class of g-Chaln Periodic Sorting NetworksDavid Nassimi, Yehoshua Perl, Ronald I. Becker. ipps 1994: 424-432

1993

A Shifting Algorithm for Constrained min-max Partition on TreesEliezer Agasi, Ronald I. Becker, Yehoshua Perl. DAM, 45(1):1-28, 1993. [doi]

The New Class of g-Chain Periodic SortersRonald I. Becker, David Nassimi, Yehoshua Perl. spaa 1993: 356-364 [doi]

1985

Finding the two-core of a treeRonald I. Becker, Yehoshua Perl. DAM, 11(2):103-113, 1985. [doi]

1984

A Bottom-Up Algorithm for Weight- and Height-Bounded Minimal Partitions of TreesRonald I. Becker, Stephen R. Schach. caap 1984: 63-72

1983

Shifting Algorithms for Tree Partitioning with General Weighting FunctionsRonald I. Becker, Yehoshua Perl. jal, 4(2):101-120, 1983.

1982

Drawing labelled directed binary graphs on a gridRonald I. Becker, Stephen R. Schach. ACMse 1982: 30-34 [doi]

A Shifting Algorithm for Min-Max Tree PartitioningRonald I. Becker, Stephen R. Schach, Yehoshua Perl. JACM, 29(1):58-67, 1982. [doi]

1980

A Shifting Algorithm for Min-Max Tree PartitioningRonald I. Becker, Yehoshua Perl, Stephen R. Schach. icalp 1980: 64-75

Sign in or sign up to see more results.

runs on WebDSL