Roberto Solis-Oba

870 total citations
46 papers, 408 citations indexed

About

Roberto Solis-Oba is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Roberto Solis-Oba has authored 46 papers receiving a total of 408 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Industrial and Manufacturing Engineering, 22 papers in Computer Networks and Communications and 12 papers in Computational Theory and Mathematics. Recurrent topics in Roberto Solis-Oba's work include Optimization and Search Problems (16 papers), Optimization and Packing Problems (14 papers) and Scheduling and Optimization Algorithms (14 papers). Roberto Solis-Oba is often cited by papers focused on Optimization and Search Problems (16 papers), Optimization and Packing Problems (14 papers) and Scheduling and Optimization Algorithms (14 papers). Roberto Solis-Oba collaborates with scholars based in Canada, Germany and United States. Roberto Solis-Oba's co-authors include Klaus Jansen, Greg N. Frederickson, Monaldo Mastrolilli, Maxim Sviridenko, Lucian Ilie, Frank Dehne, Jörg-Rüdiger Sack, Saad Bin Ahmed, Piotr Krysta and Qinghui Liu and has published in prestigious journals such as European Journal of Operational Research, BMC Bioinformatics and Applied Sciences.

In The Last Decade

Roberto Solis-Oba

42 papers receiving 379 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Roberto Solis-Oba Canada 12 221 179 122 63 42 46 408
Giacomo Zambelli Italy 10 135 0.6× 50 0.3× 232 1.9× 51 0.8× 67 1.6× 24 410
Bernard Ries France 12 86 0.4× 143 0.8× 275 2.3× 28 0.4× 98 2.3× 62 440
Giulia Galbiati Italy 12 171 0.8× 168 0.9× 269 2.2× 44 0.7× 63 1.5× 32 469
Volker Kaibel Germany 12 112 0.5× 58 0.3× 203 1.7× 30 0.5× 82 2.0× 37 360
P. M. Camerini Italy 11 122 0.6× 114 0.6× 190 1.6× 39 0.6× 58 1.4× 19 389
Laura Sanità Canada 7 46 0.2× 149 0.8× 215 1.8× 38 0.6× 89 2.1× 34 350
Yoram J. Sussmann United States 7 90 0.4× 135 0.8× 64 0.5× 32 0.5× 34 0.8× 7 258
Yuqi Chen China 4 73 0.3× 145 0.8× 59 0.5× 7 0.1× 54 1.3× 10 369
Stefano Smriglio Italy 11 176 0.8× 188 1.1× 117 1.0× 12 0.2× 60 1.4× 23 438
Daniel E. Steffy United States 8 100 0.5× 113 0.6× 183 1.5× 13 0.2× 66 1.6× 16 388

Countries citing papers authored by Roberto Solis-Oba

Since Specialization
Citations

This map shows the geographic impact of Roberto Solis-Oba's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Roberto Solis-Oba with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Roberto Solis-Oba more than expected).

Fields of papers citing papers by Roberto Solis-Oba

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Roberto Solis-Oba. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Roberto Solis-Oba. The network helps show where Roberto Solis-Oba may publish in the future.

Co-authorship network of co-authors of Roberto Solis-Oba

This figure shows the co-authorship network connecting the top 25 collaborators of Roberto Solis-Oba. A scholar is included among the top collaborators of Roberto Solis-Oba based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Roberto Solis-Oba. Roberto Solis-Oba is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Solis-Oba, Roberto, et al.. (2024). Algorithms for the thief orienteering problem on directed acyclic graphs. Theoretical Computer Science. 1023. 114900–114900. 1 indexed citations
2.
Solis-Oba, Roberto, et al.. (2020). Makespan minimization on unrelated parallel machines with a few bags. Theoretical Computer Science. 821. 34–44. 11 indexed citations
3.
Solis-Oba, Roberto, et al.. (2019). Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments. Theoretical Computer Science. 809. 204–217. 1 indexed citations
4.
Solis-Oba, Roberto, et al.. (2018). Labeling Mycielski Graphs with a Condition at Distance Two.. Ars Combinatoria. 140. 337–349. 1 indexed citations
5.
Averbakh, Igor, et al.. (2017). L(2,1)-Labeling of Kneser graphs and coloring squares of Kneser graphs. Discrete Applied Mathematics. 221. 106–114. 1 indexed citations
6.
Ilie, Lucian, et al.. (2014). SAGE: String-overlap Assembly of GEnomes. BMC Bioinformatics. 15(1). 302–302. 7 indexed citations
7.
Dehne, Frank, Roberto Solis-Oba, & Jörg-Rüdiger Sack. (2013). Algorithms and data structures : 13th international symposium, WADS 2013, London, ON, Canada, August 12-14, 2013 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 5 indexed citations
8.
Solis-Oba, Roberto, et al.. (2013). L(2,1)-labelings on the modular product of two graphs. Theoretical Computer Science. 487. 74–81. 7 indexed citations
9.
Jansen, Klaus & Roberto Solis-Oba. (2009). Rectangle packing with one-dimensional resource augmentation. Discrete Optimization. 6(3). 310–323. 20 indexed citations
10.
Liu, Qinghui & Roberto Solis-Oba. (2008). Web Prefetching with Machine Learning Algorithms.. International Conference on Internet Computing. 142–148. 3 indexed citations
11.
Fishkin, Aleksei V., et al.. (2008). On Packing Rectangles with Resource Augmentation: Maximizing the Profit. 3(1). 2 indexed citations
12.
Jansen, Klaus & Roberto Solis-Oba. (2006). An asymptotic approximation algorithm for 3D-strip packing. Symposium on Discrete Algorithms. 143–152. 13 indexed citations
13.
Fishkin, Aleksei V., et al.. (2005). On packing squares with resource augmentation: maximizing the profit. 61–67. 1 indexed citations
14.
Frederickson, Greg N. & Roberto Solis-Oba. (2005). Efficient algorithms for robustness in resource allocation and scheduling problems. Theoretical Computer Science. 352(1-3). 250–265. 4 indexed citations
15.
Jansen, Klaus & Roberto Solis-Oba. (2003). An asymptotic fully polynomial time approximation scheme for bin covering. Theoretical Computer Science. 306(1-3). 543–551. 23 indexed citations
16.
Sanders, Peter & Roberto Solis-Oba. (2000). How Helpers Hasten h-Relations. Journal of Algorithms. 41(1). 392–402. 1 indexed citations
17.
Solis-Oba, Roberto, Klaus Jansen, & Maxim Sviridenko. (1999). A linear time approximation scheme for the job shop scheduling problem. Max Planck Institute for Plasma Physics. 177–188. 8 indexed citations
18.
Solis-Oba, Roberto, Klaus Jansen, & Maxim Sviridenko. (1999). Makespan minimization in job shops: a polynomial time approximation scheme. Max Planck Institute for Plasma Physics. 394–399. 2 indexed citations
19.
Frederickson, Greg N. & Roberto Solis-Oba. (1997). Efficient algorithms for robustness in matroid optimization. Symposium on Discrete Algorithms. 659–668. 9 indexed citations
20.
Frederickson, Greg N. & Roberto Solis-Oba. (1996). Increasing the weight of minimum spanning trees. Symposium on Discrete Algorithms. 539–546. 27 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026