default search action
Sven Mallach
Person information
- affiliation: University of Cologne, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Sven Mallach
:
Inductive linearization for binary quadratic programs with linear constraints: a computational study. 4OR 22(1): 47-87 (2024) - [j12]Sven Mallach
A quadratic simplex algorithm for primal optimization over zero-one polytopes. Discret. Appl. Math. 347: 285-296 (2024) - [c12]Sven Mallach
A Family of Spanning-Tree Formulations for the Maximum Cut Problem. ISCO 2024: 43-55 - 2023
- [j11]Sven Mallach
Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem. EURO J. Comput. Optim. 11: 100071 (2023) - [c11]Jonas Charfreitag
Integer Programming for the Maximum Cut Problem: A Refined Model and Implications for Branching. ACDA 2023: 63-74 - [c10]Sven Mallach
On Integer Linear Programs for Treewidth Based on Perfect Elimination Orderings. IWOCA 2023: 294-306 - 2022
- [c9]Jonas Charfreitag
McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. ALENEX 2022: 54-66 - 2021
- [j10]Sven Mallach
Inductive linearization for binary quadratic programs with linear constraints. 4OR 19(4): 549-570 (2021) - [j9]Michael Jünger, Sven Mallach
Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. INFORMS J. Comput. 33(4): 1419-1430 (2021) - [j8]Sven Mallach
A note on labeling methods to schedule unit execution time tasks in the presence of delayed precedence constraints. J. Parallel Distributed Comput. 156: 1-6 (2021)
2010 – 2019
- 2019
- [c8]Michael Jünger, Sven Mallach
Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. ESA 2019: 63:1-63:13 - [c7]Sven Mallach
A Natural Quadratic Approach to the Generalized Graph Layering Problem. GD 2019: 532-544 - [i4]Sven Mallach:
A Natural Quadratic Approach to the Generalized Graph Layering Problem. CoRR abs/1908.04104 (2019) - 2018
- [j7]Sven Mallach
Compact linearization for binary quadratic problems subject to assignment constraints. 4OR 16(3): 295-309 (2018) - [j6]Sven Mallach
Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays. J. Comb. Optim. 36(3): 871-895 (2018) - [j5]Sven Mallach
Linear ordering based MIP formulations for the vertex separation or pathwidth problem. J. Discrete Algorithms 52-53: 156-167 (2018) - 2017
- [c6]Sven Mallach
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem. IWOCA 2017: 327-340 - 2016
- [j4]Michael Jünger, Sven Mallach
An integer programming approach to optimal basic block instruction scheduling for single-issue processors. Discret. Optim. 22: 37-65 (2016) - [c5]Adalat Jabrayilov
Compact Layered Drawings of General Directed Graphs. GD 2016: 209-221 - [i3]Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Rüegg, Reinhard von Hanxleden:
Compact Layered Drawings of General Directed Graphs. CoRR abs/1609.01755 (2016) - [i2]Sven Mallach:
Compact Linearization for Binary Quadratic Problems subject to Assignment Constraints. CoRR abs/1610.05375 (2016) - 2015
- [b1]Sven Mallach:
Exact Integer Programming Approaches to Sequential Instruction Scheduling and Offset Assignment. University of Cologne, Germany, 2015 - [j3]Sven Mallach
More General Optimal Offset Assignment. Leibniz Trans. Embed. Syst. 2(1): 02:1-02:18 (2015) - [c4]Dustin Feld, Thomas Soddemann, Michael Jünger, Sven Mallach
Hardware-Aware Automatic Code-Transformation to Support Compilers in Exploiting the Multi-Level Parallel Potential of Modern CPUs. COSMIC@CGO 2015: 2:1-2:10 - 2014
- [c3]Sven Mallach
Optimal general offset assignment. SCOPES 2014: 50-59 - 2013
- [c2]Michael Jünger, Sven Mallach
Solving the simple offset assignment problem as a traveling salesman. M-SCOPES 2013: 31-39 - 2011
- [j2]Markus Geveler, Dirk Ribbrock, Sven Mallach, 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. J. Comput. Sci. 2(2): 113-123 (2011) - 2010
- [c1]Sven Mallach
Improved Scalability by Using Hardware-Aware Thread Affinities. Facing the Multicore-Challenge 2010: 29-41
2000 – 2009
- 2009
- [j1]Danny van Dyk, Markus Geveler, Sven Mallach, Dirk Ribbrock, Dominik Göddeke
HONEI: A collection of libraries for numerical computations targeting multiple processor architectures. Comput. Phys. Commun. 180(12): 2534-2543 (2009) - [i1]Danny van Dyk, Markus Geveler, Sven Mallach, Dirk Ribbrock, Dominik Göddeke, Carsten Gutwenger:
HONEI: A collection of libraries for numerical computations targeting multiple processor architectures. CoRR abs/0904.4152 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: