Vadim G. Timkovsky

Available identifiers

zbMath Open timkovsky.vadim-gMaRDI QIDQ161994

List of research outcomes

Publication	Date of Publication	Type
Integer programs for margining option portfolios by option spreads with more than four legs	2014-10-06	Paper
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles	2009-08-19	Paper
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time	2005-02-08	Paper
Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time	2004-10-28	Paper
Ideal preemptive schedules on two processors	2004-03-11	Paper
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity	2003-07-30	Paper
On scheduling cycle shops: Classification, complexity and approximation	2003-07-27	Paper
On preemption redundancy in scheduling unit processing time jobs on two parallel machines	2002-09-22	Paper
Basket problems in margin calculation: modelling and algorithms.	2001-07-05	Paper
Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems	2000-03-19	Paper
Total completion time minimization in two-machine job shops with unit-time operations	1999-02-22	Paper
String Noninclusion Optimization Problems	1998-09-21	Paper
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem	1997-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q4312913	1994-11-09	Paper
Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem	1992-09-27	Paper
Some recognition problems related to graph isomorphism	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3734131	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3737196	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3713852	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3741392	1983-01-01	Paper

Research outcomes over time

This page was built for person: Vadim G. Timkovsky