SPP 1307:  Algorithm Engineering

• Subject Area: Computer Science, Systems and Electrical Engineering
• Term: from 2007 to 2016
• Project identifier: Deutsche Forschungsgemeinschaft (DFG) - Project number 29058954

• Final Report Year: 2015

No abstract available

Publications

• A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. Proceedings of the 2008 IEEE International Symposium on Parallel and Distributed Processing (IPDPS). IEEE Computer Society, 2008.
  Meyerhenke, Henning; Monien, Burkhard & Sauerwald, Thomas
  
• An experimental study of new and known online packet buffering algorithms. Algorithmica, Vol. 57. 2010, Issue 4, pp. 725–746.
  Albers, Susanne & Jacobs, Tobias
  
• Interactive exploration of chemical space with scaffold hunter. Nature Chemical Biology, Vol. 5. 2009, pp. 581–583.
  Wetzel, Stefan; Klein, Karsten; Renner, Steffen; Rauh, Daniel; Oprea, Tudor I; Mutzel, Petra & Waldmann, Herbert
  
• Clustering for metric and nonmetric distance measures. ACM Transactions on Algorithms, Vol. 6. 2010, No. 4, 59.
  Ackermann, Marcel R.; Blömer, Johannes & Sohler, Christian
  
• Submodular Formulations for Range Assignment Problems. International Symposium on Combinatorial Optimization (ISCO). Electronic Notes in Discrete Mathematics, Vol. 36. 2010, pp. 239-246.
  Baumann, Frank & Buchheim, Christoph
  
• Beyond unit propagation in SAT solving. In: P. M. Pardalos, S. Rebennack (Eds.), Experimental Algorithms: 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings, (Lecture Notes in Computer Science, vol. 6630), Springer, 2011, pp. 267–279.
  Kaufmann, Michael & Kottler, Stephan
  
• Energy-efficient sorting using solid state disks. Sustainable Computing: Sustainable Computing: Informatics and Systems, Vol. 1. 2011, Issue 2: Special Issue on Selected Papers from the 2010 Green Computing Conference, pp. 151-163.
  Beckmann, Andreas; Meyer, Ulrich; Sanders, Peter & Singler, Johannes
  
• How to apply sat-solving for the equivalence test of monotone normal forms. In: Theory and Applications of Satisfiability Testing - SAT 2011: 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings. (Lecture Notes in Computer Science, 6695), 2011, pp. 105–119.
  Mundhenk, Martin & Zeranski, Robert
  
• Integrated sequencing and scheduling in coil coating. Management Science, Vol. 57.2011, Issue 4, pp. 647–666.
  Höhn, Wiebke; König, Felix G.; Möhring, Rolf H. & Lübbecke, Marco E.
  
• Broccoli: Semantic full-text search at your fingertips. CoRR, abs/1207.2615, 2012.
  Hannah Bast, Florian Bäurle, Björn Buchhold, Elmar Haussmann
  
• Certifying feasibility and objective value of linear programs. Operations Research Letters, Vol. 40. 2012, Issue 4, pp. 292-297.
  Althaus, Ernst & Dumitriu, Daniel
  
• Shape matching by random sampling. Theoretical Computer Science, Vol. 442. 2012, pp. 2-12.
  Alt, Helmut & Scharf, Ludmila
  
• Dynamic Graph Clustering Combining Modularity and Smoothness. ACM Journal of Experimental Algorithmics, Vol. 18. 2013, Issue 1, pp 1.1–1.29.
  Görke, Robert; Maillard, Pascal; Schumm, Andrea; Staudt, Christian & Wagner, Dorothea
  
• Spherical visibility sampling. (In 24th Eurographics Symposium on Rendering). Computer Graphics Forum, Vol. 32. 2013, Issue 4, pp. 49-58.
  Eikel, Benjamin; Jähn, Claudius; Fischer, Matthias & auf der Heide, Friedhelm Meyer
  
• The Satisfiability Problem: Algorithms and Analyses. (Mathematik für Anwendungen, Band 3), Lehmanns Media, 2013, 184 S., ISBN 978-3-86541-527-1.
  Jacobo Toran, Uwe Schöning
  
• Automatic Dantzig-Wolfe reformulation of mixed integer programs. Mathematical Programming, Vol. 149. 2015, Issue 1-2, pp. 391–424.
  Bergner, Martin; Caprara, Alberto; Ceselli, Alberto; Furini, Fabio; Lübbecke, Marco E.; Malaguti, Enrico & Traversi, Emiliano
  
• Facets for art gallery problems. Algorithmica, Vol. 73. 2015, pp. 411–440.
  Fekete, Sándor P.; Friedrichs, Stephan; Kröller, Alexander & Schmidt, Christiane
  
• The price of strict and light robustness in timetable information. Transportation Science, Vol. 48. 2014, No. 2, pp. 225–242.
  Goerigk, Marc; Schmidt, Marie; Schöbel, Anita; Knoth, Martin & Müller-Hannemann, Matthias
  
• Randomized rounding in the presence of a cardinality constraint. ACM Journal of Experimental Algorithmics, Vol. 19.2014.
  Doerr, Benjamin & Wahlström, Magnus
  
• The robust knapsack problem with queries. Computers & Operations Research, Vol. 55. 2015, pp. 12-22.
  Goerigk, Marc; Gupta, Manoj; Ide, Jonas; Schöbel, Anita & Sen, Sandeep