Jiřı́ Sgall

3.7k total citations
86 papers, 1.6k citations indexed

About

Jiřı́ Sgall is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Jiřı́ Sgall has authored 86 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Computer Networks and Communications, 41 papers in Industrial and Manufacturing Engineering and 25 papers in Computational Theory and Mathematics. Recurrent topics in Jiřı́ Sgall's work include Optimization and Search Problems (44 papers), Scheduling and Optimization Algorithms (32 papers) and Complexity and Algorithms in Graphs (18 papers). Jiřı́ Sgall is often cited by papers focused on Optimization and Search Problems (44 papers), Scheduling and Optimization Algorithms (32 papers) and Complexity and Algorithms in Graphs (18 papers). Jiřı́ Sgall collaborates with scholars based in Czechia, United States and Israel. Jiřı́ Sgall's co-authors include Gerhard J. Woeginger, Marek Chrobák, György Dósa, Russell Impagliazzo, Pavel Pudlák, Leah Epstein, Dan Boneh, Richard J. Lipton, Anja Feldmann and Shang‐Hua Teng and has published in prestigious journals such as Operations Research, Neural Computation and SIAM Journal on Computing.

In The Last Decade

Jiřı́ Sgall

81 papers receiving 1.4k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Jiřı́ Sgall Czechia 23 863 605 450 268 150 86 1.6k
Reuven Bar-Yehuda Israel 23 1.2k 1.4× 253 0.4× 757 1.7× 220 0.8× 82 0.5× 58 1.9k
Piotr Berman United States 25 1.2k 1.4× 205 0.3× 860 1.9× 410 1.5× 127 0.8× 110 2.2k
D. S. Johnson United States 8 744 0.9× 594 1.0× 588 1.3× 252 0.9× 72 0.5× 11 1.7k
Guy Even Israel 25 632 0.7× 183 0.3× 1.0k 2.3× 221 0.8× 57 0.4× 92 1.9k
Marco Protasi Italy 8 373 0.4× 175 0.3× 500 1.1× 300 1.1× 79 0.5× 29 979
Michael Jünger Germany 16 244 0.3× 406 0.7× 530 1.2× 268 1.0× 101 0.7× 30 1.4k
Hadas Shachnai Israel 20 827 1.0× 279 0.5× 323 0.7× 138 0.5× 83 0.6× 85 1.2k
Juraj Hromkovič Germany 17 317 0.4× 118 0.2× 573 1.3× 383 1.4× 55 0.4× 128 1.0k
Fabrizio Grandoni Switzerland 19 674 0.8× 119 0.2× 870 1.9× 222 0.8× 74 0.5× 84 1.4k
Kaile Su China 21 572 0.7× 224 0.4× 509 1.1× 652 2.4× 97 0.6× 120 1.3k

Countries citing papers authored by Jiřı́ Sgall

Since Specialization
Citations

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

Fields of papers citing papers by Jiřı́ Sgall

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jiřı́ Sgall. 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 Jiřı́ Sgall. The network helps show where Jiřı́ Sgall may publish in the future.

Co-authorship network of co-authors of Jiřı́ Sgall

This figure shows the co-authorship network connecting the top 25 collaborators of Jiřı́ Sgall. A scholar is included among the top collaborators of Jiřı́ Sgall 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 Jiřı́ Sgall. Jiřı́ Sgall 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.
Sgall, Jiřı́ & Gerhard J. Woeginger. (2023). Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms. Operations Research Letters. 51(6). 583–590. 4 indexed citations
2.
Balogh, János, József Békési, György Dósa, Jiřı́ Sgall, & Rob van Stee. (2019). The optimal absolute ratio for online bin packing. Journal of Computer and System Sciences. 102. 1–17. 8 indexed citations
3.
Pol, Jaco van de, Mohammad Reza Mousavi, & Jiřı́ Sgall. (2017). Parallel Algorithms for Model Checking. Lecture notes in computer science. 10608. 1 indexed citations
4.
Chatterjee, Krishnendu & Jiřı́ Sgall. (2013). Mathematical Foundations of Computer Science 2013. Lecture notes in computer science. 1 indexed citations
5.
6.
Bruhn, Henning, Jakub Černý, Alexander Hall, Petr Kolman, & Jiřı́ Sgall. (2008). . Theory of Computing. 4(1). 1–20. 4 indexed citations
7.
Sgall, Jiřı́, et al.. (2007). Optimal and Online Preemptive Scheduling on Uniformly Related Machines. 1 indexed citations
8.
Bruhn, Henning, Jakub Černý, Alexander Hall, Petr Kolman, & Jiřı́ Sgall. (2007). . Theory of Computing. 4(1). 1–20. 2 indexed citations
9.
Woeginger, Gerhard J. & Jiřı́ Sgall. (2006). On the complexity of cake cutting. Discrete Optimization. 4(2). 213–220. 34 indexed citations
10.
Chrobák, Marek & Jiřı́ Sgall. (2004). The weighted 2-server problem. Theoretical Computer Science. 324(2-3). 289–312. 10 indexed citations
11.
Král͏̌, Daniel, et al.. (2003). It is tough to be a plumber. Theoretical Computer Science. 313(3). 473–484. 2 indexed citations
12.
13.
Woeginger, Gerhard J., et al.. (2001). The complexity of coloring graphs without long induced paths. Acta Cybernetica. 15(1). 107–117. 29 indexed citations
14.
Sgall, Jiřı́. (2001). Solution of David Gale's lion and man problem. Theoretical Computer Science. 259(1-2). 663–670. 75 indexed citations
15.
Parnas, Michal, et al.. (2000). Efficient dynamic traitor tracing. Symposium on Discrete Algorithms. 586–595. 11 indexed citations
16.
Epstein, Leah, et al.. (1999). Randomized online scheduling on two uniform machines. University of Twente Research Information. 317–326. 6 indexed citations
17.
Azar, Yossi, et al.. (1998). Ancient and new algorithms for load balancing in the Lp norm. Symposium on Discrete Algorithms. 426–435. 20 indexed citations
18.
Impagliazzo, Russell, Pavel Pudlák, & Jiřı́ Sgall. (1997). Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm. Electronic colloquium on computational complexity. 4. 19 indexed citations
19.
Feldmann, Anja, et al.. (1995). Competitive Analysis of Call Admission Algorithms that Allow Delay. 8 indexed citations
20.
Feldmann, Anja, Jiřı́ Sgall, & Shang‐Hua Teng. (1994). Dynamic scheduling on parallel machines. Theoretical Computer Science. 130(1). 49–72. 45 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

Breakdown of academic impact, for papers by Reuven Bar-Yehuda Breakdown of academic impact, for papers by Piotr Berman Breakdown of academic impact, for papers by D. S. Johnson Breakdown of academic impact, for papers by Guy Even Breakdown of academic impact, for papers by Marco Protasi Breakdown of academic impact, for papers by Michael Jünger Breakdown of academic impact, for papers by Hadas Shachnai Breakdown of academic impact, for papers by Juraj Hromkovič Breakdown of academic impact, for papers by Fabrizio Grandoni Breakdown of academic impact, for papers by Kaile Su
Rankless by CCL
2026