Bibliography

Journal Articles (Peer Reviewed)

[1] Michael Jünger and Sven Mallach. Exact facetial odd-cycle separation for maximum cut and binary quadratic optimization. INFORMS J. on Computing, 2020. [ bib | DOI ]
[2] Sven Mallach. A note on labeling methods to schedule unit execution time tasks in the presence of delayed precedence constraints. Journal of Parallel and Distributed Computing, 156:1--6, 2021. [ bib | DOI ]
[3] Sven Mallach. Inductive linearization for binary quadratic programs with linear constraints. 4OR, 10 2020. [ bib | DOI ]
[4] Sven Mallach. Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays. Journal of Combinatorial Optimization, 36(3):871--895, 10 2018. [ bib | DOI ]
[5] Sven Mallach. Compact linearization for binary quadratic problems subject to assignment constraints. 4OR, 16(3):295--309, 9 2018. [ bib | DOI ]
[6] Sven Mallach. Linear ordering based mip formulations for the vertex separation or pathwidth problem. J. of Discrete Algorithms, 52-53:156--167, 2018. Combinatorial Algorithms -- Special Issue Devoted to Life and Work of Mirka Miller. [ bib | DOI ]
[7] Michael Jünger and Sven Mallach. An integer programming approach to optimal basic block instruction scheduling for single-issue processors. Discrete Optimization, 22(A):37--65, 11 2016. [ bib | DOI ]
[8] Sven Mallach. More general optimal offset assignment. Leibniz Transactions on Embedded Systems, 2(1):02--1--02:18, 2015. [ bib | DOI ]
[9] Markus Geveler, Dirk Ribbrock, Sven Mallach, and Dominik Göddeke. A simulation suite for lattice-boltzmann based real-time CFD applications exploiting multi-level parallelism on modern multi- and many-core architectures. Journal of Computational Science, 2(2):113--123, 2011. Simulation Software for Supercomputers. [ bib | DOI ]
[10] Danny van Dyk, Markus Geveler, Sven Mallach, Dirk Ribbrock, Dominik Göddeke, and Carsten Gutwenger. Honei: A collection of libraries for numerical computations targeting multiple processor architectures. Computer Physics Communications, 180(12):2534--2543, 2009. 40 YEARS OF CPC: A celebratory issue focused on quality software for high performance, grid and novel computing architectures. [ bib | DOI ]

Conference Proceedings (Peer Reviewed)

[1] Jonas Charfreitag, Michael Jünger, Sven Mallach, and Petra Mutzel. McSparse: Exact solutions of sparse maximum cut and sparse unconstrained binary quadratic optimization problems. In Cynthia A. Phillips and Bettina Speckmann, editors, 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), pages 54--66, 2022. [ bib | DOI ]
[2] Michael Jünger and Sven Mallach. Odd-cycle separation for maximum cut and binary quadratic optimization. In Michael A. Bender, Ola Svensson, and Grzegorz Herman, editors, 27th Annual European Symposium on Algorithms (ESA 2019), volume 144 of Leibniz International Proceedings in Informatics (LIPIcs), pages 63:1--63:13, Dagstuhl, Germany, 2019. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. [ bib | DOI ]
[3] Sven Mallach. A natural quadratic approach to the generalized graph layering problem. In Daniel Archambault and Csaba D. Tóth, editors, Proc. 27th Int. Symp. on Graph Drawing and Network Visualization, Cham, 2019. Springer. [ bib | DOI ]
[4] Sven Mallach. Linear ordering based MIP formulations for the vertex separation or pathwidth problem. In Ljiljana Brankovic, Joe Ryan, and William F. Smyth, editors, Combinatorial Algorithms, pages 327--340, Cham, 2018. Springer. [ bib | DOI ]
[5] Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Rüegg, and Reinhard von Hanxleden. Compact layered drawings of general directed graphs. In Yifan Hu and Martin Nöllenburg, editors, Proc. 24 Int. Symp. on Graph Drawing and Network Visualization, pages 209--221, Cham, 2016. Springer. [ bib | DOI ]
[6] Dustin Feld, Thomas Soddemann, Michael Jünger, and Sven Mallach. Hardware-aware automatic code-transformation to support compilers in exploiting the multi-level parallel potential of modern cpus. In Proceedings of the 2015 International Workshop on Code Optimisation for Multi and Many Cores, COSMIC '15, pages 2:1--2:10, New York, NY, USA, 2015. ACM. [ bib | DOI ]
[7] Sven Mallach and Roberto Castañeda Lozano. Optimal general offset assignment. In Proc. 17th Int. W. on Softw. and Compilers for Embed. Syst., SCOPES '14, pages 50--59, New York, NY, USA, 2014. ACM. [ bib | DOI ]
[8] Dustin Feld, Thomas Soddemann, Michael Jünger, and Sven Mallach. Facilitate simd-code-generation in the polyhedral model by hardware-aware automatic code-transformation. In Proceedings of the 3rd International Workshop on Polyhedral Compilation Techniques, pages 45--54, 2013. [ bib ]
[9] Michael Jünger and Sven Mallach. Solving the simple offset assignment problem as a traveling salesman. In Proc. 16th Int. W. on Softw. and Compilers for Embed. Syst., M-SCOPES '13, pages 31--39. ACM, 2013. [ bib | DOI ]
[10] Sven Mallach and Carsten Gutwenger. Improved scalability by using hardware-aware thread affinities. In Rainer Keller, David Kramer, and Jan-Philipp Weiss, editors, Facing the Multicore-Challenge: Aspects of New Paradigms and Technologies in Parallel Computing, pages 29--41, Heidelberg, Germany, 2010. Springer. [ bib | DOI ]

Preprints / Working Papers

[1] Sven Mallach. A quadratic simplex algorithm for primal optimization over zero-one polytopes. Extended abstract, University of Bonn, Germany, 5 2022. [ bib | pdf ]
[2] Sven Mallach. Inductive linearization for binary quadratic programs with linear constraints: A computational study. Preprint, optimization online, University of Bonn, Germany, 06 2021. [ bib | pdf ]
[3] Sven Mallach. Compact linearization for binary quadratic problems comprising linear constraints, 2018. [ bib | arXiv ]
[4] Sven Mallach. Compact linearization for binary quadratic problems subject to linear equations, 2017. [ bib | arXiv ]
[5] Sven Mallach. A practical mixed-integer programming model for the vertex separation number problem. Preprint, University of Cologne, Germany, 10 2015. [ bib | http ]
[6] Martin Gronemann, Michael J√ľnger, Sven Mallach, and Daniel R. Schmidt. Towards shortest longest edges in orthogonal graph drawing. Preprint, University of Cologne, Germany, 12 2011. [ bib | http ]
[7] Sven Mallach. On separation pairs and split components of biconnected graphs. Preprint, University of Cologne, Germany, 06 2011. [ bib | http ]

Theses

[1] Sven Mallach. Exact Integer Programming Approaches to Sequential Instruction Scheduling and Offset Assignment. PhD thesis, Universität zu Köln, 3 2015. [ bib ]
[2] Sven Mallach. Beschleunigung ausgewählter paralleler standard template library algorithmen. Master's thesis, Technische Universität Dortmund, 11 2008. [ bib ]