World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
34
Citations
4258
World Ranking
12267
National Ranking
27

Overview

Jiří Sgall is affiliated with Charles University in the Czech Republic, focusing primarily on research in computer science and engineering. Their work addresses complex problems in optimization, scheduling, and computational theory.

The primary fields of study include:

  • Computer Science
  • Engineering

Within these fields, their research spans several subfields such as:

  • Computer Networks and Communications
  • Industrial and Manufacturing Engineering
  • Computational Theory and Mathematics
  • Management Information Systems
  • Electrical and Electronic Engineering

The main topics covered in Jiří Sgall's research include:

  • Optimization and Search Problems
  • Scheduling and Optimization Algorithms
  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Interconnection Networks and Systems
  • Optimization and Packing Problems
  • Supply Chain and Inventory Management

Jiří Sgall has contributed to a number of papers published in respected venues, with recent works including:

  • "Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms," 2023, Operations Research Letters
  • "Online Algorithms for Multilevel Aggregation," 2020, Operations Research
  • "A φ-Competitive Algorithm for Scheduling Packets with Deadlines," 2022, SIAM Journal on Computing
  • "New results on multi-level aggregation," 2021, Theoretical Computer Science
  • "Improved online load balancing with known makespan," 2024, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent publication venues for Jiří Sgall include:

  • Theoretical Computer Science
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Operations Research Letters
  • Operations Research
  • SIAM Journal on Computing

Their collaborative work prominently features coauthors such as:

  • Pavel Veselý
  • Martin Böhm
  • Marek Chrobák
  • Marcin Bieńkowski
  • Łukasz Jeż

Best Publications

  • Multiprocessor Scheduling with Rejection

    Yair Bartal;Stefano Leonardi;Alberto Marchetti-Spaccamela;Jirí Sgall

  • On the computational power of DNA

    Dan Boneh;Christopher Dunworth;Richard J. Lipton;Jiří Sgall

  • On-line Scheduling

    Unknown

  • Dynamic scheduling on parallel machines

    Anja Feldmann;Jiří Sgall;Shang-Hua Teng

  • Lower bounds for the polynomial calculus and the Gröbner basis algorithm

    Russell Impagliazzo;Pavel Pudlák;Jiří Sgall

  • Semi-online scheduling with decreasing job sizes

    Steve Seiden;Jiřı Sgall;Gerhard Woeginger

  • Proof complexity in algebraic systems and bounded depth Frege systems with modular counting

    S. Buss;R. Impagliazzo;J. Krajíček;P. Pudlák

  • Online competitive algorithms for maximizing weighted throughput of unit jobs

    Francis Y. L. Chin;Marek Chrobak;Stanley P. Y. Fung;Wojciech Jawor

  • Graph balancing: a special case of scheduling unrelated parallel machines

    Tomáš Ebenlendr;Marek Krčál;Jiří Sgall

  • Energy-Aware Scheduling for Streaming Applications on Chip Multiprocessors

    Ruibin Xu;R. Melhem;D. Mosse

  • On the complexity of cake cutting

    Gerhard J. Woeginger;Jiří Sgall

  • Boolean Circuits, Tensor Ranks, and Communication Complexity

    Pavel Pudlák;Vojtech Rödl;Jirí Sgall

  • Optimal online scheduling of parallel jobs with dependencies

    Anja Feldmann;Ming-Yang Kao;Jiří Sgall;Shang-Hua Teng

  • A lower bound for randomized on-line multiprocessor scheduling

    Jiří Sgall

  • Computer-Aided Complexity Classification of Dial-a-Ride Problems

    Willem E. de Paepe;Jan Karel Lenstra;Jiri Sgall;René A. Sitters

  • Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help

    Marek Chrobak;Wojciech Jawor;Jir caron;i´ Sgall

  • Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs

    Yair Bartal;Francis Y. L. Chin;Marek Chrobak;Stanley P. Y. Fung

  • The greedy algorithm for the minimum common string partition problem

    Marek Chrobak;Petr Kolman;Jiří Sgall

  • Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

    Leah Epstein;Jiri Sgall

  • A lower bound for on-line scheduling on uniformly related machines

    Leah Epstein;Jiřı Sgall

  • Improved online algorithms for buffer management in QoS switches

    Marek Chrobak;Wojciech Jawor;Jiří Sgall;Tomáš Tichý

  • Ancient and new algorithms for load balancing in the Lp norm

    Adi Avidor;Yossi Azar;Jiří Sgall

  • Dynamic scheduling on parallel machines

    S. Feldmann;J. Sgall;S.-H. Teng

  • Randomized online scheduling on two uniform machines

    Leah Epstein;John Noga;Steve Seiden;Jiří Sgall

Frequent Co-Authors

Marek Chrobak
Marek Chrobak University of California, Riverside
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Leah Epstein
Leah Epstein University of Haifa
Shang-Hua Teng
Shang-Hua Teng University of Southern California
Anja Feldmann
Anja Feldmann Max Planck Society
Leen Stougie
Leen Stougie Centrum Wiskunde & Informatica
Yair Bartal
Yair Bartal Hebrew University of Jerusalem
Monika Henzinger
Monika Henzinger Institute of Science and Technology Austria
Francis Y. L. Chin
Francis Y. L. Chin University of Hong Kong
Ming-Yang Kao
Ming-Yang Kao Northwestern University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online pathways in Computer Science opens doors to numerous career options. It’s important to consider related fields that blend technical skills with other disciplines. For example, if you’re interested in applying your CS knowledge to environmental challenges, learning more about what can you do with an environmental studies degree can inspire new, impactful career directions.

A growing number of students are also seeking the fastest route to graduation. Opting for an accelerated computer science degree can help you enter the workforce quickly while building a strong technical foundation.

Looking beyond computer science, engineering fields are becoming more accessible through online learning. You could consider environmental engineering schools online if you’re drawn to sustainability and technology. Those fascinated by machines and innovation might explore an online degree in mechanical engineering.

Each of these related online degrees offers unique career pathways and skill sets, helping you align your studies with your future goals.

Best Scientists Citing Jiří Sgall

Trending Scientists

Recently Published Articles