Matthias Poloczek

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Bayesian Optimization Allowing for Common Random Numbers Operations Research	2023-01-10	Paper
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ACM Journal of Experimental Algorithmics	2018-08-06	Paper
Simple approximation algorithms for balanced MAX~2SAT Algorithmica	2018-04-11	Paper
Erratum to: ``Greedy matching: guarantees and limitations Algorithmica	2018-02-28	Paper
Contagious sets in dense graphs European Journal of Combinatorics	2017-11-14	Paper
Randomized variants of Johnson's algorithm for MAX SAT	2017-09-29	Paper
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds SIAM Journal on Computing	2017-06-28	Paper
Greedy matching: guarantees and limitations Algorithmica	2017-03-06	Paper
Simple Approximation Algorithms for Balanced MAX 2SAT LATIN 2016: Theoretical Informatics	2016-05-03	Paper
Contagious sets in dense graphs Lecture Notes in Computer Science	2016-04-04	Paper
On Some Recent Approximation Algorithms for MAX SAT LATIN 2014: Theoretical Informatics	2014-03-31	Paper
Bounds on greedy algorithms for MAX SAT Algorithms – ESA 2011	2011-09-16	Paper

Research outcomes over time

This page was built for person: Matthias Poloczek