815110
Lehrstuhl für Management Science| ID | I:(DE-82)815110_20140620 |
⇦ Lehrstuhl für Wirtschaftsinformatik und Operations Research ⇧ RWTH Aachen ⇧
All known publications ...
Download: BibTeX | EndNote XML, Text | RIS |
Journal Article
A simplified analysis of the ascending auction to sell a matroid base
Operations research letters 64, 107381 (2026) [10.1016/j.orl.2025.107381]
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Dissertation / PhD Thesis
Matroid optimization in auction theory
Aachen : RWTH Aachen University 1 Online-Ressource : Illustrationen (2025) [10.18154/RWTH-2025-10701] = Dissertation, Rheinisch-Westfälische Technische Hochschule Aachen, 2025
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Journal Article
Faster Dynamic Auctions via Polymatroid Sum
ACM Transactions on Economics and Computation 13(3), 13:[1]-13:47 (2025) [10.1145/3729429]
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Contribution to a book/Contribution to a conference proceedings
Using Explicit (Host-to-Network) Flow Measurements for Network Tomography
Proceedings of the 2025 Applied Networking Research Workshop
ACM/IRTF Applied Networking Research Workshop, ANRW 2025, MadridMadrid, Spain, 22 Jul 2025 - 22 Jul 2025
New York, NY : Association for Computing Machinery, ACM conferences 54-61 (2025) [10.1145/3744200.3744769]
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Bachelor Thesis
Tailoring a matroid-constrained ascending Vickrey auction to representable matroids
Aachen : RWTH Aachen University 1 Online-Ressource : Illustrationen (2025) [10.18154/RWTH-2025-04826] = Bachelorarbeit, Rheinisch-Westfälische Technische Hochschule Aachen, 2024
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Journal Article/Contribution to a conference proceedings
Upper bounds and approximation results for the k-slow burning problem
19. Cologne-Twente Workshop on graphs and Combinatorial Optimization, CTW 2023, Garmisch-PartenkirchenGarmisch-Partenkirchen, Germany, 20 Jun 2023 - 22 Jun 2023
Discrete applied mathematics 363, 88-104 (2025) [10.1016/j.dam.2024.11.025] special issue: "Graphs and Combinatorial Optimization (CTW 2023) / Guest Editors: Stefan Pickl, Andreas Brieden, Markus Siegle"
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Contribution to a book/Contribution to a conference proceedings
k-Slow Burning: Complexity and Upper Bounds
Graphs and combinatorial optimization: from theory to applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20–22 / Andreas Brieden, Stefan Pickl, Markus Siegle editors
19. Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2023, Garmisch-PartenkirchenGarmisch-Partenkirchen, Germany, 20 Jun 2023 - 22 Jun 2023
Cham, Switzerland : Springer, AIRO Springer series 13, 67-79 (2024) [10.1007/978-3-031-46826-1_6]
BibTeX |
EndNote:
XML,
Text |
RIS
Journal Article
A flow-based ascending auction to compute buyer-optimal Walrasian prices
Networks : an interantional journal 84(2), 161-180 (2024) [10.1002/net.22218]
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Journal Article/Contribution to a book
Designing distributed decision-making authorities for smart factories – understanding the role of manufacturing network architecture
International journal of production research 62(1/2), 204-222 (2023) [10.1080/00207543.2023.2217285] special issue: "Special Issue: Special issue in memory of Dr. Jean-Marie Proth (7.12.1938–17.06.2021)"
BibTeX |
EndNote:
XML,
Text |
RIS
Preprint
Stackelberg Vertex Cover on a Path
22 Seiten (2023) [10.48550/arXiv.2307.06772]
Fulltext by arXiv.org
BibTeX |
EndNote:
XML,
Text |
RIS
All known publications ...
Download: BibTeX | EndNote XML, Text | RIS |