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

Nodari Vakhania

dblp:11/6406 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
1since 2021 · last 2022
0000-0002-9013-9334ORCID · corroborated

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

Theory of computation · 7 · 3 first-author · 1 since 2021

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 · 67% Approximation and online algorithms · 33%

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

TopicWeightPapersLastEvidence papers
Approximation and online algorithms
online algorithms		 0.012002
Preemptive Scheduling in Overloaded Systems · ICALP 2002
Mathematical optimization › scheduling › job scheduling
preemptive scheduling		 0.012002
Preemptive Scheduling in Overloaded Systems · ICALP 2002
Mathematical optimization
scheduling		 0.012002
Preemptive Scheduling in Overloaded Systems · ICALP 2002
YearPublicationVenuePosition
2022 A polynomial-time approximation to a minimum dominating set in a graph
Frank Angel Hernández Mira, Ernesto Parra Inza, José María Sigarreta, Nodari Vakhania
 Theor. Comput. Sci.4
2019 Fast solution of single-machine scheduling problem with embedded jobs
Nodari Vakhania
 Theor. Comput. Sci.1
2013 Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
Nodari Vakhania, Frank Werner 0001
 Theor. Comput. Sci.1
2012 Branch less, cut more and minimize the number of late equal-length jobs on identical machines
Nodari Vakhania
 Theor. Comput. Sci.1
2003 Preemptive scheduling in overloaded systems
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
 J. Comput. Syst. Sci.7
2002 Preemptive Scheduling in Overloaded Systems
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
 ICALP7
2000 Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine
J. M. van den Akker, Han Hoogeveen, Nodari Vakhania
 ESA3