Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Tomás Ebenlendr

dblp:55/6637 · DBLP profile ↗
← Back
12ranked-venue papers
11as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 12 · 11 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 61% Graph algorithms and graph theory · 30% Approximation and online algorithms · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › graph optimization
graph balancing		 0.112008
Graph balancing: a special case of scheduling unrelated parallel machines · SODA 2008
Mathematical optimization
scheduling		 0.112008
Graph balancing: a special case of scheduling unrelated parallel machines · SODA 2008
Mathematical optimization › scheduling › parallel machine scheduling
unrelated machines		 0.112008
Graph balancing: a special case of scheduling unrelated parallel machines · SODA 2008
Approximation and online algorithms
approximation algorithms		 0.012008
Graph balancing: a special case of scheduling unrelated parallel machines · SODA 2008

Methods — techniques the papers use, named apart from their topics

LP rounding · 0.1
YearPublicationVenuePosition
2015 A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption
Tomás Ebenlendr, Jirí Sgall
 Theory Comput. Syst.1
2014 Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines
Tomás Ebenlendr, Marek Krcál, Jirí Sgall
 Algorithmica1
2011 A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
Tomás Ebenlendr, Jirí Sgall
 WAOA1
2011 Semi-Online Preemptive Scheduling: One Algorithm for All Variants
Tomás Ebenlendr, Jirí Sgall
 Theory Comput. Syst.1
2009 Semi-Online Preemptive Scheduling: One Algorithm for All Variants
abstract
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for all types of semi-online restrictions, including the ones studied before, like sorted (decreasing) jobs, known sum of processing times, known maximal processing time, their combinations, and so on. Based on the analysis of this algorithm, we derive some global relations between various semi-online restrictions and tight bounds on the approximation ratios for a small number of machines.
Tomás Ebenlendr, Jirí Sgall
 STACS1
2009 Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
 Algorithmica1
2008 Graph balancing: a special case of scheduling unrelated parallel machines
Tomás Ebenlendr, Marek Krcál, Jirí Sgall
 SODA1
2008 A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
Tomás Ebenlendr, Jirí Sgall
 WAOA1
2007 Online Scheduling of Equal-Length Jobs on Parallel Machines
Jihuan Ding, Tomás Ebenlendr, Jirí Sgall, Guochuan Zhang
 ESA2
2006 Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
 ESA1
2005 A Note on Semi-online Machine Covering
Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger
 WAOA1
2004 Optimal and Online Preemptive Scheduling on Uniformly Related Machines
Tomás Ebenlendr, Jirí Sgall
 STACS1