José Verschae

564 total citations
20 papers, 127 citations indexed

About

José Verschae is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, José Verschae has authored 20 papers receiving a total of 127 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Industrial and Manufacturing Engineering, 15 papers in Computer Networks and Communications and 6 papers in Computational Theory and Mathematics. Recurrent topics in José Verschae's work include Scheduling and Optimization Algorithms (16 papers), Optimization and Search Problems (15 papers) and Optimization and Packing Problems (10 papers). José Verschae is often cited by papers focused on Scheduling and Optimization Algorithms (16 papers), Optimization and Search Problems (15 papers) and Optimization and Packing Problems (10 papers). José Verschae collaborates with scholars based in Chile, Germany and United States. José Verschae's co-authors include Martin Skutella, José Correa, Andreas Wiese, Nicole Megow, Leen Stougie, Julián Mestre, David B. Shmoys, Ola Svensson, Alberto Marchetti-Spaccamela and Lin Chen and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Mathematical Programming and SIAM Journal on Computing.

In The Last Decade

José Verschae

17 papers receiving 124 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
José Verschae Chile	7	96	82	17	15	10	20	127
Wojciech Jawor United States	7	68 0.7×	136 1.7×	13 0.8×	23 1.5×	36 3.6×	8	146
Marin Bougeret France	4	38 0.4×	32 0.4×	13 0.8×	13 0.9×	4 0.4×	24	75
Yakov M. Shafransky Belarus	8	256 2.7×	126 1.5×	22 1.3×	5 0.3×	2 0.2×	18	285
Gábor Galambos Hungary	8	160 1.7×	152 1.9×	13 0.8×	17 1.1×	23 2.3×	14	211
Héctor Joaquín Fraire Huacuja Mexico	5	55 0.6×	32 0.4×	15 0.9×	12 0.8×	6 0.6×	19	116
Laurent Perron United States	5	45 0.5×	40 0.5×	19 1.1×	13 0.9×	4 0.4×	9	87
Dimitrios Letsios France	7	69 0.7×	52 0.6×	4 0.2×	8 0.5×	9 0.9×	14	111
Joann Moore United States	2	252 2.6×	178 2.2×	12 0.7×	21 1.4×	6 0.6×	3	294
Houssem Eddine Nouri Tunisia	6	260 2.7×	51 0.6×	8 0.5×	14 0.9×	6 0.6×	18	283
Tobias Mömke Germany	7	46 0.5×	56 0.7×	10 0.6×	58 3.9×	14 1.4×	25	118

Countries citing papers authored by José Verschae

Since Specialization

Citations

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

Fields of papers citing papers by José Verschae

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of José Verschae

This figure shows the co-authorship network connecting the top 25 collaborators of José Verschae. A scholar is included among the top collaborators of José Verschae 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é Verschae. José Verschae 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

Castro, Luis M., et al.. (2024). Identifying outbreaks in sewer networks: An adaptive sampling scheme under network’s uncertainty. Proceedings of the National Academy of Sciences. 121(14). e2316616121–e2316616121. 1 indexed citations

Verschae, José, et al.. (2022). On the geometry of symmetry breaking inequalities. Mathematical Programming. 197(2). 693–719. 1 indexed citations

Chen, Lin, et al.. (2021). Optimal algorithms for scheduling under time-of-use tariffs. Annals of Operations Research. 304(1-2). 85–107. 9 indexed citations

Verschae, José, et al.. (2020). Breaking symmetries to rescue sum of squares in the case of makespan scheduling. Mathematical Programming. 183(1-2). 583–618.

Groß, Martin, et al.. (2018). A Local-Search Algorithm for Steiner Forest. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 4 indexed citations

Megow, Nicole & José Verschae. (2018). Dual Techniques for Scheduling on a Machine with Varying Speed. SIAM Journal on Discrete Mathematics. 32(3). 1541–1571. 5 indexed citations

Antoniadis, Antonios, et al.. (2017). A QPTAS for the General Scheduling Problem with Identical Release Dates. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14.

Mestre, Julián, et al.. (2017). A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. SIAM Journal on Discrete Mathematics. 31(2). 825–838. 6 indexed citations

Jansen, Klaus, et al.. (2017). Improved Efficient Approximation Schemes for Scheduling Jobs on Identical and Uniform Machines. 3 indexed citations

10.

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

11.

Correa, José, et al.. (2016). Splitting versus setup trade-offs for scheduling to minimize weighted completion time. Operations Research Letters. 44(4). 469–473. 4 indexed citations

12.

Schulz, Andreas S. & José Verschae. (2016). Min-Sum Scheduling Under Precedence Constraints. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

13.

McCormick, S. Thomas, et al.. (2016). Primal–Dual Algorithms for Precedence Constrained Covering Problems. Algorithmica. 78(3). 771–787. 2 indexed citations

14.

Megow, Nicole, Martin Skutella, José Verschae, & Andreas Wiese. (2016). The Power of Recourse for Online MST and TSP. SIAM Journal on Computing. 45(3). 859–880. 7 indexed citations

15.

Skutella, Martin & José Verschae. (2016). Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures. Mathematics of Operations Research. 41(3). 991–1021. 18 indexed citations

16.

Correa, José, et al.. (2014). Strong LP formulations for scheduling splittable jobs on unrelated machines. Mathematical Programming. 154(1-2). 305–328. 16 indexed citations

17.

Verschae, José & Andreas Wiese. (2013). On the configuration-LP for scheduling on unrelated machines. Journal of Scheduling. 17(4). 371–383. 17 indexed citations

18.

Correa, José, Martin Skutella, & José Verschae. (2011). The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. Mathematics of Operations Research. 37(2). 379–398. 26 indexed citations

19.

Megow, Nicole & José Verschae. (2009). Short Note on Scheduling on a Single Machine with one Non-availability Period. 4 indexed citations

20.

Skutella, Martin & José Verschae. (2009). A Robust PTAS for the Parallel Machine Covering Problem. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 0.

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