default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNodari Vakhania
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Ernesto Parra Inza
, Nodari Vakhania, José María Sigarreta Almira, José Alberto Hernández Aguilar:
Approximating a Minimum Dominating Set by Purification. Algorithms 17(6): 258 (2024)- [j22]Ernesto Parra Inza, Nodari Vakhania, José María Sigarreta Almira, Frank Angel Hernández Mira:
Exact and heuristic algorithms for the domination problem. Eur. J. Oper. Res. 313(3): 926-936 (2024) - [i11]Ernesto Parra Inza, José María Sigarreta Almira, Nodari Vakhania:
Reducing Dominating Sets in Graphs. CoRR abs/2404.18028 (2024) - [i10]Víctor Pacheco-Valencia, Nodari Vakhania:
An Algorithm for the Euclidean Bounded Multiple Traveling Salesman Problem. CoRR abs/2405.18615 (2024) - [i9]Nodari Vakhania, Frank Werner, Kevin Johedan Ramírez-Fuentes, Víctor Pacheco-Valencia:
An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability. CoRR abs/2405.18789 (2024) - 2023
- [j21]Jan Karel Lenstra, Nodari Vakhania:
On the complexity of scheduling unrelated parallel machines with limited preemptions. Oper. Res. Lett. 51(2): 187-189 (2023) - [i8]Ernesto Parra Inza, Nodari Vakhania, José María Sigarreta Almira, Frank Angel Hernández Mira:
Algorithms for the Global Domination Problem. CoRR abs/2312.04526 (2023) - 2022
- [j20]Víctor Hugo Pacheco-Valencia, Nodari Vakhania, Frank Angel Hernández Mira, José Alberto Hernández Aguilar:
A Multi-Phase Method for Euclidean Traveling Salesman Problems. Axioms 11(9): 439 (2022) - [j19]Frank Angel Hernández Mira, Ernesto Parra Inza, José M. Sigarreta Almira, Nodari Vakhania:
A polynomial-time approximation to a minimum dominating set in a graph. Theor. Comput. Sci. 930: 142-156 (2022) - [i7]Nodari Vakhania, Frank Werner, Alejandro Reynoso:
Scheduling a single machine with compressible jobs to minimize maximum lateness. CoRR abs/2203.09800 (2022) - [i6]Nodari Vakhania:
On Preemptive Scheduling of Unrelated Machines Using Linear Programming. CoRR abs/2205.02351 (2022) - [i5]Frank Hernandez, Ernesto Parra, José María Sigarreta, Nodari Vakhania:
A polynomial-time approximation to a minimum dominating set in a graph. CoRR abs/2207.04560 (2022) - [i4]Nodari Vakhania:
Variable Parameter Analysis for Scheduling One Machine. CoRR abs/2211.02107 (2022) - [i3]Ernesto Parra Inza, Frank Angel Hernández Mira, José María Sigarreta Almira, Nodari Vakhania:
Exact and Approximation Algorithms for the Domination Problem. CoRR abs/2211.07019 (2022) - 2021
- [j18]Alejandro Reynoso, Nodari Vakhania:
Theoretical and practical issues in single-machine scheduling with two job release and delivery times. J. Sched. 24(6): 615-647 (2021) - [i2]Nodari Vakhania:
Compact enumeration for scheduling one machine. CoRR abs/2103.09900 (2021) - 2020
- [j17]Víctor Hugo Pacheco-Valencia, José Alberto Hernández, José María Sigarreta, Nodari Vakhania:
Simple Constructive, Insertion, and Improvement Heuristics Based on the Girding Polygon for the Euclidean Traveling Salesman Problem. Algorithms 13(1): 5 (2020)
2010 – 2019
- 2019
- [j16]Nodari Vakhania:
Fast solution of single-machine scheduling problem with embedded jobs. Theor. Comput. Sci. 782: 91-106 (2019) - 2018
- [j15]Nodari Vakhania:
Scheduling a Single Machine with Primary and Secondary Objectives. Algorithms 11(6): 80 (2018) - 2013
- [j14]Nodari Vakhania:
A study of single-machine scheduling problem to maximize throughput. J. Sched. 16(4): 395-403 (2013) - [j13]Nodari Vakhania, Frank Werner:
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time. Theor. Comput. Sci. 501: 72-81 (2013) - 2012
- [j12]Nodari Vakhania:
Branch less, cut more and minimize the number of late equal-length jobs on identical machines. Theor. Comput. Sci. 465: 49-60 (2012) - 2011
- [j11]Evgeny V. Shchepin, Nodari Vakhania:
A note on the proof of the complexity of the little-preemptive open-shop problem. Ann. Oper. Res. 191(1): 251-253 (2011)
2000 – 2009
- 2009
- [j10]Nodari Vakhania:
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs. Oper. Res. Lett. 37(6): 405-410 (2009) - 2008
- [j9]Evgeny V. Shchepin, Nodari Vakhania:
On the geometry, preemptions and complexity of multiprocessor and shop scheduling. Ann. Oper. Res. 159(1): 183-213 (2008) - 2007
- [c6]Nodari Vakhania:
Global Estimations for Multiprocessor Job-Shop. CISched 2007: 65-71 - 2005
- [j8]Evgeny V. Shchepin, Nodari Vakhania:
An optimal rounding gives a better approximation for scheduling unrelated machines. Oper. Res. Lett. 33(2): 127-133 (2005) - 2004
- [j7]Nodari Vakhania:
Single-Machine Scheduling with Release Times and Tails. Ann. Oper. Res. 129(1-4): 253-271 (2004) - [j6]Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania:
Preemptive scheduling of equal-length jobs to maximize weighted throughput. Oper. Res. Lett. 32(3): 258-264 (2004) - 2003
- [j5]Nodari Vakhania:
A better algorithm for sequencing with release and delivery times on identical machines. J. Algorithms 48(2): 273-293 (2003) - [j4]Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania:
Preemptive scheduling in overloaded systems. J. Comput. Syst. Sci. 67(1): 183-197 (2003) - 2002
- [j3]Nodari Vakhania:
Scheduling Equal-Length Jobs with Delivery times on Identical Processors. Int. J. Comput. Math. 79(6): 715-728 (2002) - [j2]Evgeny V. Shchepin, Nodari Vakhania:
Little-Preemptive Scheduling on Unrelated Processors. J. Math. Model. Algorithms 1(1): 43-56 (2002) - [c5]Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania:
Preemptive Scheduling in Overloaded Systems. ICALP 2002: 800-811 - [i1]Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania:
Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput. CoRR cs.DS/0209033 (2002) - 2001
- [j1]Nodari Vakhania:
Tight Performance Bounds of CP-Scheduling on Out-Trees. J. Comb. Optim. 5(4): 445-464 (2001) - 2000
- [c4]Marjan van den Akker, Han Hoogeveen, Nodari Vakhania:
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine. ESA 2000: 427-436 - [c3]Evgeny V. Shchepin, Nodari Vakhania:
Task Distributions on Multiprocessor Systems. IFIP TCS 2000: 112-125 - [c2]Nodari Vakhania:
Global and Local Search for Scheduling Job Shop with Parallel Machines. IBERAMIA-SBIA 2000: 63-75
1990 – 1999
- 1997
- [c1]Nodari Vakhania:
Sequencing jobs with readiness times and tails on parallel machines. SAC 1997: 438-446
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
