No. Title Author Year
1 An Investigation of the Recoverable Robust Assignment Problem Fischer, Dennis et al. 2021
2 Graph Colorings (Dagstuhl Seminar 03391) Nesetril, Jaroslav et al. 2021
3 Online Algorithms (Dagstuhl Seminar 02271) Albers, Susanne et al. 2021
4 The Travelling Salesman Problem (Dagstuhl Seminar 02261) Johnson, David S. et al. 2021
5 Dispersing Obnoxious Facilities on a Graph Grigoriev, Alexander et al. 2019
6 Graph Similarity and Approximate Isomorphism Grohe, Martin et al. 2018
7 The Open Shop Scheduling Problem Woeginger, Gerhard J. 2018
8 Motion planning with pulley, rope, and baskets Eggermont, Christian E.J. et al. 2012
9 Analysis of multi-stage open shop processing systems Eggermont, Christian E.J. et al. 2011
10 The Traveling Salesman Problem under Squared Euclidean Distances van Nijnatten, Fred et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 10

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI