Marc Uetz
Orcid: 0000-0003-4223-2435
According to our database1,
Marc Uetz
authored at least 69 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024
2023
OR Spectr., March, 2023
2022
Int. Trans. Oper. Res., 2022
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022
2021
Corrigendum: Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling.
Math. Oper. Res., 2021
Ann. Oper. Res., 2021
2020
Oper. Res. Lett., 2020
Math. Oper. Res., 2020
Int. J. Game Theory, 2020
2019
Oper. Res. Lett., 2019
Math. Oper. Res., 2019
Discret. Optim., 2019
2017
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017
Proceedings of the Integer Programming and Combinatorial Optimization, 2017
2016
Math. Oper. Res., 2016
Oper. Res., 2016
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope.
Discret. Appl. Math., 2016
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016
2015
Proceedings of the Web and Internet Economics - 11th International Conference, 2015
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015
2014
Proceedings of the Web and Internet Economics - 10th International Conference, 2014
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
2013
Proceedings of the Integer Programming and Combinatorial Optimization, 2013
Two-dimensional optimal mechanism design for a single machine scheduling problem.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013
2011
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011
2010
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010
2009
Discret. Optim., 2009
2008
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008
2007
On revenue equivalence in truthful mechanisms.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007
Optimal bundle pricing for homogeneous items.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007
2006
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006
Proceedings of the Algorithm Theory, 2006
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times.
Proceedings of the Approximation, 2006
2005
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
Proceedings of the Hybrid Metaheuristics, Second International Workshop, 2005
2004
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004
2003
Electron. Notes Discret. Math., 2003
2001
Scheduling precedence-constrained jobs with stochastic processing times on parallel machines.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
1999
J. ACM, 1999
Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies.
Proceedings of the Randomization, 1999
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.
Proceedings of the Algorithms, 1999