Остановите войну!
for scientists:
default search action
Monaldo Mastrolilli
- > Home > Persons > Monaldo Mastrolilli
Publications
- 2024
- [j38]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems. ACM Trans. Comput. Theory 16(1): 3:1-3:16 (2024) - 2022
- [j36]Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson, Mark Zuckerberg:
On inequalities with bounded coefficients and pitch for the min knapsack polytope. Discret. Optim. 44(Part): 100567 (2022) - 2020
- [j33]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-squares hierarchy lower bounds for symmetric formulations. Math. Program. 182(1): 369-397 (2020) - 2018
- [j31]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-squares rank upper bounds for matching problems. J. Comb. Optim. 36(3): 831-844 (2018) - [j30]Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. 172(1-2): 231-248 (2018) - [c38]Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson:
On Bounded Pitch Inequalities for the Min-Knapsack Polytope. ISCO 2018: 170-182 - [i12]Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson:
On bounded pitch inequalities for the min-knapsack polytope. CoRR abs/1801.08850 (2018) - 2017
- [j29]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. Math. Oper. Res. 42(1): 135-143 (2017) - [j28]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. Math. Program. 166(1-2): 1-17 (2017) - [e2]Klaus Jansen, Monaldo Mastrolilli:
Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10138, Springer 2017, ISBN 978-3-319-51740-7 [contents] - 2016
- [c36]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. ICALP 2016: 78:1-78:14 - [c35]Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO 2016: 152-163 - [c34]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. IPCO 2016: 362-374 - [c33]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-Squares Rank Upper Bounds for Matching Problems. ISCO 2016: 403-413 - [i9]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Tight Sum-of-Squares lower bounds for binary polynomial optimization problems. CoRR abs/1605.03019 (2016) - [i8]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-squares hierarchy lower bounds for symmetric formulations. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c32]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. ESA 2015: 853-864 - [c31]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy. ICALP (1) 2015: 872-885 - [i7]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. CoRR abs/1510.01891 (2015) - [i6]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. CoRR abs/1511.08644 (2015) - 2014
- [j26]Monaldo Mastrolilli, Georgios Stamoulis:
Bi-criteria and approximation algorithms for restricted matchings. Theor. Comput. Sci. 540: 115-132 (2014) - [c30]Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. WABI 2014: 14-25 - [i5]Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities. CoRR abs/1407.1746 (2014) - 2013
- [j25]Monaldo Mastrolilli, Arash Rafiey:
On the approximation of minimum cost homomorphism to bipartite graphs. Discret. Appl. Math. 161(4-5): 670-676 (2013) - [j23]Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
Single machine scheduling with scenarios. Theor. Comput. Sci. 477: 57-66 (2013) - [c29]Marek Cygan, Fabrizio Grandoni, Monaldo Mastrolilli:
How to Sell Hyperedges: The Hypermatching Assignment Problem. SODA 2013: 342-351 - [i4]Monaldo Mastrolilli, Georgios Stamoulis:
Bi-Criteria and Approximation Algorithms for Restricted Matchings. CoRR abs/1311.5481 (2013) - 2012
- [c28]Monaldo Mastrolilli, Georgios Stamoulis:
Restricted Max-Min Fair Allocations with Inclusion-Free Intervals. COCOON 2012: 98-108 - [c27]Pavol Hell, Monaldo Mastrolilli, Mayssam Mohammadi Nevisi, Arash Rafiey:
Approximation of Minimum Cost Homomorphisms. ESA 2012: 587-598 - [c26]Monaldo Mastrolilli, Georgios Stamoulis:
Constrained Matching Problems in Bipartite Graphs. ISCO 2012: 344-355 - [c24]Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis:
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. WAOA 2012: 159-172 - 2011
- [j22]Monaldo Mastrolilli, Ola Svensson:
Hardness of Approximating Flow and Job Shop Scheduling Problems. J. ACM 58(5): 20:1-20:32 (2011) - [j21]Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
On the Approximability of Single-Machine Scheduling with Precedence Constraints. Math. Oper. Res. 36(4): 653-669 (2011) - [j20]Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson:
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. SIAM J. Comput. 40(2): 567-596 (2011) - 2010
- [j18]Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan:
Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett. 38(5): 390-395 (2010) - 2009
- [j17]Christoph Ambühl, Monaldo Mastrolilli:
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. Algorithmica 53(4): 488-503 (2009) - [c22]Monaldo Mastrolilli, Ola Svensson:
Improved Bounds for Flow Shop Scheduling. ICALP (1) 2009: 677-688 - 2008
- [j16]Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster. Algorithmica 51(2): 183-199 (2008) - [j15]Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders. Bull. EATCS 95: 37-58 (2008) - [c21]Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
Approximating Single Machine Scheduling with Scenarios. APPROX-RANDOM 2008: 153-164 - [c20]Monaldo Mastrolilli, Ola Svensson:
(Acyclic) JobShops are Hard to Approximate. FOCS 2008: 583-592 - 2007
- [c19]Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson:
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. FOCS 2007: 329-337 - [c17]Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
Scheduling with Precedence Constraints of Low Fractional Dimension. IPCO 2007: 130-144 - 2006
- [c16]Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson:
Approximating Precedence-Constrained Single Machine Scheduling by Coloring. APPROX-RANDOM 2006: 15-26 - [c15]Christoph Ambühl, Monaldo Mastrolilli:
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. ESA 2006: 28-39 - 2005
- [j8]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Approximation schemes for job shop scheduling problems with controllable processing times. Eur. J. Oper. Res. 167(2): 297-319 (2005) - [j7]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Approximation algorithms for flexible job shop problems. Int. J. Found. Comput. Sci. 16(2): 361-379 (2005) - [j6]Christoph Ambühl, Monaldo Mastrolilli:
On-line scheduling to minimize max flow time: an optimal preemptive algorithm. Oper. Res. Lett. 33(6): 597-602 (2005) - 2004
- [j5]Klaus Jansen, Monaldo Mastrolilli:
Approximation schemes for parallel machine scheduling problems with controllable processing times. Comput. Oper. Res. 31(10): 1565-1581 (2004) - 2003
- [c11]Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. ISAAC 2003: 319-328 - [e1]Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim:
Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings. Lecture Notes in Computer Science 2647, Springer 2003, ISBN 3-540-40205-5 [contents] - 2001
- [c6]Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster. ESA 2001: 206-217 - [c3]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Job Shop Scheduling Problems with Controllable Processing Times. ICTCS 2001: 107-122 - 2000
- [c2]Klaus Jansen, Monaldo Mastrolilli:
Parallel Machine Scheduling Problems with Controllable Processing Times. ICALP Satellite Workshops 2000: 179-190 - [c1]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Approximation Algorithms for Flexible Job Shop Problems. LATIN 2000: 68-77
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-02 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint