On the Impact of Combinatorial Structure on Congestion Games. - Heiner Ackermann; Heiko Röglin; Berthold Vöcking (Electron. Colloquium Comput. Complex., 2006)

A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games. - Heiner Ackermann (SAGA, 2007)

Decision-making based on approximate and smoothed Pareto curves. - Heiner Ackermann; Alantha Newman; Heiko Röglin; Berthold Vöcking (Theor. Comput. Sci., 2007)

On the Convergence Time of the Best Response Dynamics in Player-specific Congestion Games - Heiner Ackermann; Heiko Röglin (CoRR, 2008)

Who Should Pay for Forwarding Packets? - Heiner Ackermann; Patrick Briest; Alexander Fanghänel; Berthold Vöcking (Internet Math., 2008)

A Unified Approach to Congestion Games and Two-Sided Markets. - Heiner Ackermann; Paul W. Goldberg; Vahab S. Mirrokni; Heiko Röglin; Berthold Vöcking (Internet Math., 2008)

Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. - Heiner Ackermann; Alexander Skopalik (Internet Math., 2008)

Pure Nash equilibria in player-specific and weighted congestion games. - Heiner Ackermann; Heiko Röglin; Berthold Vöcking (Theor. Comput. Sci., 2009)

Analysis of Algorithms. - Heiner Ackermann; Heiko Röglin; Ulf Schellbach; Nils Schweer (Algorithm Engineering, 2010)

Combinatorial Auctions in Freight Logistics. - Heiner Ackermann; Hendrik Ewe; Herbert Kopfer; Karl-Heinz Küfer (ICCL, 2011)

Distributed algorithms for QoS load balancing. - Heiner Ackermann; Simon Fischer 001; Martin Hoefer 001; Marcel Schöngens (Distributed Comput., 2011)

Uncoordinated Two-Sided Matching Markets. - Heiner Ackermann; Paul W. Goldberg; Vahab S. Mirrokni; Heiko Röglin; Berthold Vöcking (SIAM J. Comput., 2011)

Modeling profit sharing in combinatorial exchanges by network flows. - Heiner Ackermann; Hendrik Ewe; Karl-Heinz Küfer; Michael Schröder (Ann. Oper. Res., 2014)

Concurrent imitation dynamics in congestion games. - Heiner Ackermann; Petra Berenbrink; Simon Fischer 001; Martin Hoefer 001 (Distributed Comput., 2016)

Time-hierarchical scheduling - A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem. - Jens Leoff; Heiner Ackermann; Karl-Heinz Küfer (J. Sched., 2016)

Decision Support for Material Procurement. - Heiner Ackermann; Erik Diessel; Michael Helmling; Christoph Hertrich; Neil Jami; Johanna Schneider (OR, 2019)

Analyzing and Optimizing the Throughput of a Pharmaceutical Production Process. - Heiner Ackermann; Sandy Heydrich; Christian Weiß 003 (OR, 2019)

Domino sequencing: Scheduling with state-based sequence-dependent setup times. - Erik Diessel; Heiner Ackermann (Oper. Res. Lett., 2019)

A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber. - Heiner Ackermann; Erik Diessel (EURO J. Comput. Optim., 2020)

Scheduling a proportionate flow shop of batching machines. - Christoph Hertrich; Christian Weiß 003; Heiner Ackermann; Sandy Heydrich; Sven O. Krumke (J. Sched., 2020)

Scheduling a Two Stage Proportionate Flexible Flow Shop with Dedicated Machines and No Buffers. - Heiner Ackermann; Lena Schwehm; Christian Weiß 003 (OR, 2021)

Robust flows with adaptive mitigation. - Heiner Ackermann; Erik Diessel; Sven O. Krumke (EURO J. Comput. Optim., 2021)

Online algorithms to schedule a proportionate flexible flow shop of batching machines. - Christoph Hertrich; Christian Weiß 003; Heiner Ackermann; Sandy Heydrich; Sven O. Krumke (J. Sched., 2022)

Computing Optimal Mitigation Plans for Force-Majeure Scenarios in Dynamic Manufacturing Chains. - Heiner Ackermann; Erik Diessel; Michael Helmling; Neil Jami; Johanna Münch (Oper. Res. Forum, 2024)

Scheduling a single machine with multiple due dates per job. - Raphael Kühn; Christian Weiß 003; Heiner Ackermann; Sandy Heydrich (J. Sched., 2024)

Mixed-Integer Modeling for Multi-Criteria Optimization of 6G Service Placement. - Marius Corici; Fabian Eichhorn; Heiner Ackermann; Daniel Hauer; Jean-Bertrand Gauthier; Rebecca Leonie Gertkemper (NetSoft, 2025)