 | 2012 |
| 11 |  | Yuri Malitsky,
Meinolf Sellmann:
Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation.
CPAIOR 2012: 244-259 |
| 2011 |
| 10 |  | Serdar Kadioglu,
Yuri Malitsky,
Ashish Sabharwal,
Horst Samulowitz,
Meinolf Sellmann:
Algorithm Selection and Scheduling.
CP 2011: 454-469 |
| 9 |  | Christian Kroer,
Yuri Malitsky:
Feature Filtering for Instance-Specific Algorithm Configuration.
ICTAI 2011: 849-855 |
| 8 |  | Yuri Malitsky,
Ashish Sabharwal,
Horst Samulowitz,
Meinolf Sellmann:
Non-Model-Based Algorithm Portfolios for SAT.
SAT 2011: 369-370 |
| 2010 |
| 7 |  | Yuri Malitsky,
Meinolf Sellmann,
Radoslaw Szymanek:
Filtering Bounded Knapsack Constraints in Expected Sublinear Time.
AAAI 2010 |
| 6 |  | Serdar Kadioglu,
Yuri Malitsky,
Meinolf Sellmann,
Kevin Tierney:
ISAC - Instance-Specific Algorithm Configuration.
ECAI 2010: 751-756 |
| 5 |  | Yuri Malitsky,
Meinolf Sellmann:
Stochastic Offline Programming.
International Journal on Artificial Intelligence Tools 19(4): 351-371 (2010) |
| 2009 |
| 4 |  | Bistra N. Dilkina,
Carla P. Gomes,
Yuri Malitsky,
Ashish Sabharwal,
Meinolf Sellmann:
Backdoors to Combinatorial Optimization: Feasibility and Optimality.
CPAIOR 2009: 56-70 |
| 3 |  | Yuri Malitsky,
Meinolf Sellmann:
Stochastic Offline Programming.
ICTAI 2009: 784-791 |
| 2008 |
| 2 |  | Yuri Malitsky,
Meinolf Sellmann,
Willem Jan van Hoeve:
Length-Lex Bounds Consistency for Knapsack Constraints.
CP 2008: 266-281 |
| 2006 |
| 1 |  | Christopher Fellows,
Yuri Malitsky,
Gregory Wojtaszczyk:
Exploring GnuGo's Evaluation Function with a SVM.
AAAI 2006: 1867-1868 |