Rudolf Müller

Available identifiers

zbMath Open muller.rudolfMaRDI QIDQ678862

List of research outcomes

Publication	Date of Publication	Type
Trapezoid graphs and generalizations, geometry and algorithms	2022-12-09	Paper
The interval order polytope of a digraph	2022-08-30	Paper
Separating equilibrium in quasi-linear signaling games	2019-12-17	Paper
Transitive packing	2019-01-11	Paper
Monotonicity and revenue equivalence domains by monotonic transformations in differences	2017-06-15	Paper
Characterizing implementable allocation rules in multi-dimensional environments	2017-05-23	Paper
Implementability under monotonic transformations in differences	2015-11-19	Paper
On optimal mechanism design for a sequencing problem	2015-03-26	Paper
Optimal mechanism design for the private supply of a public good	2014-02-21	Paper
Algorithms for recognizing economic properties in matrix bid combinatorial auctions	2012-07-28	Paper
Mechanism design for decentralized online machine scheduling	2011-11-24	Paper
Characterizing incentive compatibility for convex valuations	2009-12-01	Paper
Characterization of Revenue Equivalence	2009-05-18	Paper
Optimal Mechanisms for Single Machine Scheduling	2009-01-22	Paper
Weak monotonicity and Bayes-Nash incentive compatibility	2007-11-30	Paper
Decentralization and Mechanism Design for Online Machine Scheduling	2007-09-07	Paper
Optimization issues in combinatorial auctions	2007-07-23	Paper
Transitive Packing: A Unifying Concept in Combinatorial Optimization	2003-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q4234162	1999-03-16	Paper
Trapezoid graphs and generalizations, geometry and algorithms	1997-11-27	Paper
On the partial order polytope of a digraph	1996-10-24	Paper
How to make OR-results available: A proposal for project scheduling	1996-01-30	Paper
Advanced DSS for scheduling: Software engineering aspects and the role of eigenmodels	1996-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q4859913	1996-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q4763349	1995-04-11	Paper
\(\alpha\)-vertex separator is NP-hard even for 3-regular graphs	1992-06-26	Paper

Research outcomes over time

This page was built for person: Rudolf Müller