Marcin Mucha
Marcin Mucha
Computer Science, Warsaw University
Zweryfikowany adres z mimuw.edu.pl - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Maximum matchings via Gaussian elimination
M Mucha, P Sankowski
45th Annual IEEE Symposium on Foundations of Computer Science, 248-255, 2004
3282004
-Approximation for Graphic TSP
M Mucha
Theory of computing systems 55 (4), 640-657, 2014
1002014
Maximum matchings in planar graphs via Gaussian elimination
M Mucha, P Sankowski
Algorithmica 45 (1), 3-20, 2006
672006
Lyndon words and short superstrings
M Mucha
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
552013
A 7/9-approximation algorithm for the maximum traveling salesman problem
K Paluch, M Mucha, A Madry
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
502009
On problems equivalent to (min,+)-convolution
M Cygan, M Mucha, K Węgrzycki, M Włodarczyk
ACM Transactions on Algorithms (TALG) 15 (1), 1-25, 2019
462019
Deterministic 7/8-approximation for the metric maximum TSP
L Kowalik, M Mucha
Theoretical Computer Science 410 (47-49), 5000-5009, 2009
332009
Fast dynamic transitive closure with lookahead
P Sankowski, M Mucha
Algorithmica 56 (2), 180-197, 2010
302010
Applying deep learning to right whale photo identification
R Bogucki, M Cygan, CB Khan, M Klimek, JK Milczek, M Mucha
Conservation Biology 33 (3), 676-684, 2019
242019
35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality
L Kowalik, M Mucha
Algorithmica 59 (2), 240-255, 2011
23*2011
A subquadratic approximation scheme for partition
M Mucha, K Węgrzycki, M Włodarczyk
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
182019
Dynamic beats fixed: On phase-based algorithms for file migration
M Bienkowski, J Byrka, M Mucha
ACM Transactions on Algorithms (TALG) 15 (4), 1-21, 2019
132019
Online facility location with deletions
M Cygan, A Czumaj, M Mucha, P Sankowski
arXiv preprint arXiv:1807.03839, 2018
132018
Finding maximum matchings via Gaussian elimination
M Mucha
Warsaw University, Faculty of Mathematics, Informatics and Mechanics 112, 2005
112005
Equal-subset-sum faster than the meet-in-the-middle
M Mucha, J Nederlof, J Pawlewicz, K Węgrzycki
arXiv preprint arXiv:1905.02424, 2019
82019
No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem
M Mucha, M Sviridenko
Mathematics of Operations Research 41 (1), 247-254, 2016
62016
Approximation algorithms for union and intersection covering problems
M Cygan, F Grandoni, S Leonardi, M Mucha, M Pilipczuk, P Sankowski
arXiv preprint arXiv:1102.5105, 2011
52011
A 9k kernel for nonseparating independent set in planar graphs
Ł Kowalik, M Mucha
Theoretical Computer Science 516, 86-95, 2014
42014
Fast approximation in subspaces by doubling metric decomposition
M Cygan, L Kowalik, M Mucha, M Pilipczuk, P Sankowski
European Symposium on Algorithms, 72-83, 2010
42010
Online pricing with impatient bidders
M Cygan, M Mucha, P Sankowski, Q Zhang
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
32016
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20