José A. Soto

427 total citations
20 papers, 148 citations indexed

About

José A. Soto is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, José A. Soto has authored 20 papers receiving a total of 148 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 8 papers in Computer Networks and Communications and 6 papers in Management Science and Operations Research. Recurrent topics in José A. Soto's work include Complexity and Algorithms in Graphs (11 papers), Optimization and Search Problems (8 papers) and Advanced Graph Theory Research (7 papers). José A. Soto is often cited by papers focused on Complexity and Algorithms in Graphs (11 papers), Optimization and Search Problems (8 papers) and Advanced Graph Theory Research (7 papers). José A. Soto collaborates with scholars based in Chile, United States and Germany. José A. Soto's co-authors include José Correa, Albert M. Lai, Pablo Pérez-Lantero, Sean Yu, Aditi Gupta, Thomas M. Maddox, Andrew P. Michelson, Marin H. Kollef, Philip Payne and Ryan Colvin and has published in prestigious journals such as Ecology Letters, Mathematical Programming and SIAM Journal on Computing.

In The Last Decade

José A. Soto

18 papers receiving 140 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
José A. Soto Chile	7	61	49	47	35	17	20	148
Ondřej Suchý Czechia	7	31 0.5×	13 0.3×	79 1.7×	25 0.7×	11 0.6×	31	121
Dominik Wojtczak United Kingdom	7	23 0.4×	33 0.7×	68 1.4×	69 2.0×		31	145
Tim Carnes United States	4	25 0.4×	52 1.1×	12 0.3×	23 0.7×	1 0.1×	6	220
Neha Sharma India	10	20 0.3×	13 0.3×	10 0.2×	112 3.2×		38	274
Katarzyna Paluch Poland	6	16 0.3×	36 0.7×	55 1.2×	12 0.3×	4 0.2×	14	108
Robert Haas Japan	3	23 0.4×	19 0.4×	20 0.4×	34 1.0×	2 0.1×	5	117
Abdulhakim Tlimat United States	4	8 0.1×	32 0.7×	22 0.5×	180 5.1×		4	296
John Fearnley United Kingdom	9	29 0.5×	83 1.7×	78 1.7×	63 1.8×	3 0.2×	35	181
Gregg O’Malley United Kingdom	4	20 0.3×	68 1.4×	42 0.9×	14 0.4×		7	138
Ramakant Bhardwaj India	7	11 0.2×	28 0.6×	7 0.1×	14 0.4×		75	168

Countries citing papers authored by José A. Soto

Since Specialization

Citations

This map shows the geographic impact of José A. Soto'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 José A. Soto with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites José A. Soto more than expected).

Fields of papers citing papers by José A. Soto

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by José A. Soto. 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 José A. Soto. The network helps show where José A. Soto may publish in the future.

Co-authorship network of co-authors of José A. Soto

This figure shows the co-authorship network connecting the top 25 collaborators of José A. Soto. A scholar is included among the top collaborators of José A. Soto 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 José A. Soto. José A. Soto is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Soto, José A., et al.. (2025). Online combinatorial assignment in independence systems. Mathematical Programming.

Correa, José, et al.. (2023). Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality. Mathematics of Operations Research. 49(1). 441–475. 5 indexed citations

Espanés, Pablo Moisset de, Rodrigo Ramos‐Jiliberto, & José A. Soto. (2021). Avoiding artifacts when varying the number of species in ecological models. Ecology Letters. 24(9). 1976–1987. 3 indexed citations

Soto, José A., et al.. (2021). Strong algorithms for the ordinal matroid secretary problem. Universidad de Chile. 5 indexed citations

Foraker, Randi E., Sean Yu, Aditi Gupta, et al.. (2020). Spot the difference: comparing results of analyses from real patient data and synthetic derivatives. JAMIA Open. 3(4). 557–566. 48 indexed citations

Friggstad, Zachary, et al.. (2018). LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. Algorithmica. 81(3). 1075–1095.

Skutella, Martin, et al.. (2017). Robust Randomized Matchings. Mathematics of Operations Research. 43(2). 675–692. 2 indexed citations

Soto, José A., et al.. (2016). Symmetry exploitation for Online Machine Covering with Bounded Migration. arXiv (Cornell University). 2 indexed citations

Skutella, Martin, et al.. (2015). Robust randomized matchings. Symposium on Discrete Algorithms. 1904–1915. 2 indexed citations

10.

Correa, José, et al.. (2015). Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity. Discrete & Computational Geometry. 53(2). 344–365. 9 indexed citations

11.

Chalermsook, Parinya, José Correa, Andreas Karrenbauer, et al.. (2015). On Guillotine Cutting Sequences. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1–19. 3 indexed citations

12.

Soto, José A.. (2015). Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning. SIAM Journal on Discrete Mathematics. 29(1). 259–268. 8 indexed citations

13.

Correa, José, et al.. (2015). TSP Tours in Cubic Graphs: Beyond 4/3. SIAM Journal on Discrete Mathematics. 29(2). 915–939. 11 indexed citations

14.

Kiwi, Marcos & José A. Soto. (2014). Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays. Combinatorics Probability Computing. 24(1). 254–293. 2 indexed citations

15.

Ferrer‐Paris, José R., et al.. (2014). A compilation of larval host-plant records for six families of butterflies (Lepidoptera: Papilionoidea) from available electronic resources. Figshare. 2 indexed citations

16.

Soto, José A.. (2013). Matroid Secretary Problem in the Random-Assignment Model. SIAM Journal on Computing. 42(1). 178–211. 21 indexed citations

17.

Soto, José A.. (2012). A simple PTAS for weighted matroid matching on strongly base orderable matroids. Discrete Applied Mathematics. 164. 406–412. 6 indexed citations

18.

Soto, José A.. (2011). Matroid secretary problem in the random assignment model. arXiv (Cornell University). 1275–1284. 14 indexed citations

19.

Goemans, Michel X. & José A. Soto. (2011). Contributions on secretary problems, independent sets of rectangles and related problems. 2 indexed citations

20.

Soto, José A.. (2011). A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids. Electronic Notes in Discrete Mathematics. 37. 75–80. 3 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