default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeiner Ackermann
Person information
- affiliation: Fraunhofer Institute for Industrial Mathematics (ITWM), Kaiserslautern, Germany
- affiliation: RWTH Aachen, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Heiner Ackermann, Erik Diessel, Michael Helmling, Neil Jami, Johanna Münch:
Computing Optimal Mitigation Plans for Force-Majeure Scenarios in Dynamic Manufacturing Chains. Oper. Res. Forum 5(2): 54 (2024)- 2022
- [j17]Christoph Hertrich
, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Online algorithms to schedule a proportionate flexible flow shop of batching machines. J. Sched. 25(6): 643-657 (2022) - 2021
- [j16]Heiner Ackermann, Erik Diessel, Sven O. Krumke:
Robust flows with adaptive mitigation. EURO J. Comput. Optim. 9: 100002 (2021) - [c15]Heiner Ackermann, Lena Schwehm, Christian Weiß:
Scheduling a Two Stage Proportionate Flexible Flow Shop with Dedicated Machines and No Buffers. OR 2021: 353-358 - 2020
- [j15]Heiner Ackermann, Erik Diessel:
A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber. EURO J. Comput. Optim. 8(3): 263-288 (2020) - [j14]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Scheduling a proportionate flow shop of batching machines. J. Sched. 23(5): 575-593 (2020) - [i5]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines. CoRR abs/2005.03552 (2020) - [i4]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Scheduling a Proportionate Flow Shop of Batching Machines. CoRR abs/2006.09872 (2020)
2010 – 2019
- 2019
- [j13]Erik Diessel, Heiner Ackermann:
Domino sequencing: Scheduling with state-based sequence-dependent setup times. Oper. Res. Lett. 47(4): 274-280 (2019) - [c14]Heiner Ackermann, Sandy Heydrich, Christian Weiß:
Analyzing and Optimizing the Throughput of a Pharmaceutical Production Process. OR 2019: 591-597 - [c13]Heiner Ackermann, Erik Diessel, Michael Helmling, Christoph Hertrich, Neil Jami, Johanna Schneider:
Decision Support for Material Procurement. OR 2019: 693-699 - 2016
- [j12]Heiner Ackermann, Petra Berenbrink, Simon Fischer, Martin Hoefer:
Concurrent imitation dynamics in congestion games. Distributed Comput. 29(2): 105-125 (2016) - [j11]Jens Leoff, Heiner Ackermann, Karl-Heinz Küfer:
Time-hierarchical scheduling - A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem. J. Sched. 19(3): 215-225 (2016) - 2014
- [j10]Heiner Ackermann, Hendrik Ewe, Karl-Heinz Küfer, Michael Schröder:
Modeling profit sharing in combinatorial exchanges by network flows. Ann. Oper. Res. 222(1): 5-28 (2014) - 2011
- [j9]Heiner Ackermann, Simon Fischer, Martin Hoefer, Marcel Schöngens:
Distributed algorithms for QoS load balancing. Distributed Comput. 23(5-6): 321-330 (2011) - [j8]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. 40(1): 92-106 (2011) - [c12]Heiner Ackermann, Hendrik Ewe, Herbert Kopfer, Karl-Heinz Küfer:
Combinatorial Auctions in Freight Logistics. ICCL 2011: 1-17 - 2010
- [c11]Heiner Ackermann, Heiko Röglin, Ulf Schellbach, Nils Schweer:
Analysis of Algorithms. Algorithm Engineering 2010: 127-193
2000 – 2009
- 2009
- [j7]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
Uncoordinated two-sided matching markets. SIGecom Exch. 8(1) (2009) - [j6]Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. 410(17): 1552-1563 (2009) - [c10]Heiner Ackermann, Petra Berenbrink, Simon Fischer, Martin Hoefer:
Concurrent imitation dynamics in congestion games. PODC 2009: 63-72 - [c9]Heiner Ackermann, Simon Fischer, Martin Hoefer, Marcel Schöngens:
Distributed algorithms for QoS load balancing. SPAA 2009: 197-203 - 2008
- [j5]Heiner Ackermann, Alexander Skopalik:
Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. Internet Math. 5(4): 323-342 (2008) - [j4]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
A Unified Approach to Congestion Games and Two-Sided Markets. Internet Math. 5(4): 439-457 (2008) - [j3]Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking:
Who Should Pay for Forwarding Packets? Internet Math. 5(4): 459-475 (2008) - [j2]Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
On the impact of combinatorial structure on congestion games. J. ACM 55(6): 25:1-25:22 (2008) - [c8]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
Uncoordinated two-sided matching markets. EC 2008: 256-263 - [i3]Heiner Ackermann, Heiko Röglin:
On the Convergence Time of the Best Response Dynamics in Player-specific Congestion Games. CoRR abs/0805.1130 (2008) - [i2]Heiner Ackermann, Petra Berenbrink, Simon Fischer, Martin Hoefer:
Concurrent Imitation Dynamics in Congestion Games. CoRR abs/0808.2081 (2008) - 2007
- [j1]Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking:
Decision-making based on approximate and smoothed Pareto curves. Theor. Comput. Sci. 378(3): 253-270 (2007) - [c7]Heiner Ackermann:
A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games. SAGA 2007: 58-69 - [c6]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking:
A Unified Approach to Congestion Games and Two-Sided Markets. WINE 2007: 30-41 - [c5]Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking:
Who Should Pay for Forwarding Packets? WINE 2007: 208-219 - [c4]Heiner Ackermann, Alexander Skopalik:
On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. WINE 2007: 419-430 - 2006
- [c3]Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
On the Impact of Combinatorial Structure on Congestion Games. FOCS 2006: 613-622 - [c2]Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. WINE 2006: 50-61 - [i1]Heiner Ackermann, Heiko Röglin, Berthold Vöcking:
On the Impact of Combinatorial Structure on Congestion Games. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c1]Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking:
Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC 2005: 675-684
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 2024-06-25 21:54 CEST 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:
