default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonald I. Becker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j16]Isabella Lari
, Federica Ricca, Andrea Scozzari, Ronald I. Becker:
Locating median paths on connected outerplanar graphs. Networks 57(3): 294-307 (2011)- [c8]Ronald I. Becker:
Research work with Bruno Simeone. CTW 2011: 1-3
2000 – 2009
- 2009
- [j15]Nicola Apollonio, Ronald I. Becker, Isabella Lari, Federica Ricca, Bruno Simeone:
Bicolored graph partitioning, or: gerrymandering at its worst. Discret. Appl. Math. 157(17): 3601-3614 (2009) - 2008
- [c7]Isabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker:
Locating Median Paths on Connected Outerplanar Graphs. CTW 2008: 186-188 - 2007
- [j14]Ronald I. Becker, Isabella Lari, Andrea Scozzari, Giovanni Storchi:
The location of median paths on grid graphs. Ann. Oper. Res. 150(1): 65-78 (2007) - [j13]Ronald I. Becker, Isabella Lari, Andrea Scozzari:
Algorithms for central-median paths with bounded length on trees. Eur. J. Oper. Res. 179(3): 1208-1220 (2007) - 2002
- [j12]Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari, Giovanni Storchi:
Finding the l-core of a tree. Discret. Appl. Math. 118(1-2): 25-42 (2002) - [j11]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) - [j10]Ronald I. Becker, Bruno Simeone, Yen-I Chiang:
A shifting algorithm for continuous tree partitioning. Theor. Comput. Sci. 282(2): 353-380 (2002) - 2001
- [j9]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) - [c6]Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari:
The Cent-dian Path Problem on Tree Networks. ISAAC 2001: 743-755
1990 – 1999
- 1998
- [j8]Ronald I. Becker, David Nassimi, Yehoshua Perl:
The New Class of g-Chain Periodic Sorters. J. Parallel Distributed Comput. 54(2): 206-222 (1998) - [j7]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
- [j6]Ronald I. Becker, Norman Morrison:
The errors in FFT estimation of the Fourier transform. IEEE Trans. Signal Process. 44(8): 2073-2077 (1996) - 1995
- [j5]Ronald I. Becker, Yehoshua Perl:
The Shifting Algorithm Technique for the Partitioning of Trees. Discret. Appl. Math. 62(1-3): 15-34 (1995) - 1994
- [c5]David Nassimi, Yehoshua Perl, Ronald I. Becker:
The Generalized Class of g-Chaln Periodic Sorting Networks. IPPS 1994: 424-432 - 1993
- [j4]Eliezer Agasi, Ronald I. Becker, Yehoshua Perl:
A Shifting Algorithm for Constrained min-max Partition on Trees. Discret. Appl. Math. 45(1): 1-28 (1993) - [c4]Ronald I. Becker, David Nassimi, Yehoshua Perl:
The New Class of g-Chain Periodic Sorters. SPAA 1993: 356-364
1980 – 1989
- 1985
- [j3]Ronald I. Becker, Yehoshua Perl:
Finding the two-core of a tree. Discret. Appl. Math. 11(2): 103-113 (1985) - 1984
- [c3]Ronald I. Becker, Stephen R. Schach:
A Bottom-Up Algorithm for Weight- and Height-Bounded Minimal Partitions of Trees. CAAP 1984: 63-72 - 1983
- [j2]Ronald I. Becker, Yehoshua Perl:
Shifting Algorithms for Tree Partitioning with General Weighting Functions. J. Algorithms 4(2): 101-120 (1983) - 1982
- [j1]Ronald I. Becker, Stephen R. Schach, Yehoshua Perl:
A Shifting Algorithm for Min-Max Tree Partitioning. J. ACM 29(1): 58-67 (1982) - [c2]Ronald I. Becker, Stephen R. Schach:
Drawing labelled directed binary graphs on a grid. ACM Southeast Regional Conference 1982: 30-34 - 1980
- [c1]Ronald I. Becker, Yehoshua Perl, Stephen R. Schach:
A Shifting Algorithm for Min-Max Tree Partitioning. ICALP 1980: 64-75
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
