Power of Algorithms in Discrete Optimisation

Project Information

PowAlgDO

Grant agreement ID: 714532

DOI 10.3030/714532

Project closed

EC signature date 11 November 2016

Start date 1 January 2017

End date 30 June 2022

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost € 1 437 367,00

EU contribution € 1 437 367,00

Coordinated by

THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD
United Kingdom

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Peer reviewed articles (28)

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

Author(s): Dušan Knop, Michał Pilipczuk, Marcin Wrochna
Published in: ACM Transactions on Computation Theory, 2020, ISSN 1942-3454
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3397484

Sparsification of Binary CSPs

Author(s): Silvia Butti and Stanislav Živný
Published in: SIAM Journal on Discrete Mathematics, 2020, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1242446

On rainbow-free colourings of uniform hypergraphs

Author(s): Ragnar Groot Koerkamp; Stanislav Živný
Published in: Theoretical Computer Science, 2021, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2021.06.022

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin

Author(s): Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Živný
Published in: Journal of Computer and System Sciences, Issue 109, 2020, Page(s) 95-125, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2019.12.003

The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems

Author(s): Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, Stanislav Živný
Published in: SIAM Journal on Computing, 2020, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1312745

QCSP on Reflexive Tournaments

Author(s): Benoît Larose, Petar Marković, Barnaby Martin, Daniël Palusma, Sani Smith,Stanislav Živný
Published in: ACM Transaction on Computational Logic, 2022, ISSN 1529-3785
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3508069

Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs

Author(s): Gregor Matl, Stanislav Živný
Published in: Algorithmica, Issue 82/12, 2020, Page(s) 3492-3520, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-020-00735-1

The Complexity of Approximately Counting Retractions

Author(s): Jacob Focke; Leslie Ann Goldberg; Stanislav Živný
Published in: ACM Transactions on Computation Theory, 2020, ISSN 1942-3454
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3397472

Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2

Author(s): Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Živný
Published in: Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2, 2021, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1382921

The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains

Author(s): Caterina Viola, Stanislav Zivny
Published in: ACM Transactions on Algorithms, 2021, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3458041

Binary constraint satisfaction problems defined by excluded topological minors

Author(s): David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Živný
Published in: Information and Computation, Issue 264, 2019, Page(s) 12-31, ISSN 0890-5401
Publisher: Academic Press
DOI: 10.1016/j.ic.2018.09.013

Steepest ascent can be exponential in bounded treewidth problems

Author(s): David A. Cohen, Martin C. Cooper, Artem Kaznatcheev, Mark Wallace
Published in: Operations Research Letters, Issue 48/3, 2020, Page(s) 217-224, ISSN 0167-6377
Publisher: Elsevier BV
DOI: 10.1016/j.orl.2020.02.010

The local-global property for G-invariant terms

Author(s): Kazda, Alexandr; Kompatscher, Michael
Published in: International Journal of Algebra and Computation, 2022, ISSN 0218-1967
Publisher: World Scientific Publishing Co
DOI: 10.1142/s0218196722500527

Point-Width and Max-CSPs

Author(s): Clement Carbonnel, Miguel Romero, Stanislav Zivny
Published in: ACM Transactions on Algorithms, 2020, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3409447

Discrete convexity in joint winner property

Author(s): Yuni Iwamasa, Kazuo Murota, Stanislav Živný
Published in: Discrete Optimization, Issue 28, 2018, Page(s) 78-88, ISSN 1572-5286
Publisher: Elsevier BV
DOI: 10.1016/j.disopt.2018.01.001

The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns

Author(s): Martin C. Cooper and Stanislav Zivny
Published in: Logical Methods in Computer Science, 2017, ISSN 1860-5974
Publisher: Technischen Universitat Braunschweig
DOI: 10.23638/LMCS-13(4:26)2017

Binarisation for Valued Constraint Satisfaction Problems

Author(s): David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei Krokhin, Robert Powell, Stanislav Živný
Published in: SIAM Journal on Discrete Mathematics, Issue 31/4, 2017, Page(s) 2279-2300, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/16M1088107

Functional clones and expressibility of partition functions

Author(s): Andrei Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Živný
Published in: Theoretical Computer Science, Issue 687, 2017, Page(s) 11-39, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2017.05.001

On planar valued CSPs

Author(s): Peter Fulla, Stanislav Živný
Published in: Journal of Computer and System Sciences, Issue 87, 2017, Page(s) 104-118, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2017.03.005

The Power of Sherali--Adams Relaxations for General-Valued CSPs

Author(s): Johan Thapper, Stanislav Živný
Published in: SIAM Journal on Computing, Issue 46/4, 2017, Page(s) 1241-1279, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/16M1079245

The Limits of SDP Relaxations for General-Valued CSPs

Author(s): Johan Thapper, Stanislav Živný
Published in: ACM Transactions on Computation Theory, Issue 10/3, 2018, Page(s) 1-22, ISSN 1942-3454
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3201777

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns

Author(s): Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Živný
Published in: Algorithmica, Issue 81/4, 2019, Page(s) 1699-1727, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-018-0498-2

A Tractable Class of Binary VCSPs via M-Convex Intersection

Author(s): Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Živný
Published in: ACM Transactions on Algorithms, Issue 15/3, 2019, Page(s) 1-41, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3329862

The Complexity of Promise SAT on Non-Boolean Domains

Author(s): Alex Brandts, Marcin Wrochna, Stanislav Zivny
Published in: ACM Transactions on Computation Theory, 2021, ISSN 1942-3454
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3470867

A More General Theory of Static Approximations for Conjunctive Queries

Author(s): Pablo Barceló, Miguel Romero, Thomas Zeume
Published in: Theory of Computing Systems, Issue 64/5, 2020, Page(s) 916-964, ISSN 1432-4350
Publisher: Springer Verlag
DOI: 10.1007/s00224-019-09924-0

The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side

Author(s): Clément Carbonnel, Miguel Romero, and Stanislav Živný
Published in: SIAM Journal on Computing, 2022, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1250121

The Complexity of Approximately Counting Retractions to Square-free Graphs

Author(s): Jacob Focke, Leslie Ann Goldberg, Stanislav Zivny
Published in: ACM Transactions on Algorithms, 2021, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3458040

Approximate Counting CSP Seen from the Other Side

Author(s): Andrei Bulatov and Stanislav Živný
Published in: ACM Transactions on Computation Theory, 2020, ISSN 1942-3454
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3389390

Conference proceedings (25)

Additive Sparsification of CSPs

Author(s): Eden Pelleg and Stanislav Zivny
Published in: European Symposium on Algorithms, 2021
Publisher: Dagstuhl
DOI: 10.4230/lipics.esa.2021.75

Beyond PCSP (1-in-3,NAE)

Author(s): Brandts, Alex; Živný, Stanislav
Published in: Proceedings of ICALP, 2021
Publisher: Dagstuhl
DOI: 10.4230/lipics.icalp.2021.121

The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains

Author(s): Viola, Caterina; Živný, Stanislav
Published in: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Issue 1, 2020, Page(s) 85:1--85:15
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.mfcs.2020.85

The complexity of promise SAT on non-Boolean domains

Author(s): Brandts, Alex; Wrochna, Marcin; Živný, Stanislav
Published in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Issue 1, 2020, Page(s) 17:1--17:13
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.icalp.2020.17

QCSP on Reflexive Tournaments

Author(s): Benoît Larose and Petar Marković and Barnaby Martin and Daniël Palusma and Siani Smith and Stanislav Živný
Published in: European Symposium on Algorithms, 2021
Publisher: Dagstuhl
DOI: 10.4230/lipics.esa.2021.58

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations

Author(s): Jacob Focke,Leslie Ann Goldberg, Marc Roth, Stanislav Zivny
Published in: Symposium on Principles of Database Systems, 2022
Publisher: ACM
DOI: 10.1145/3517804.3526231

Linearly ordered colourings of hypergraphs

Author(s): Tamio-Vesa Nakajima, Stanislav Zivny
Published in: Proceedings of ICALP, 2022
Publisher: Dagstuhl
DOI: 10.4230/lipics.icalp.2022.128

Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection

Author(s): Hirai, Hiroshi ; Iwamasa, Yuni ; Murota, Kazuo ; Zivny, Stanislav
Published in: 2018
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2018.39

The Complexity of Counting Surjective Homomorphisms and Compactions

Author(s): Jacob Focke, Leslie Ann Goldberg, Stanislav Živný
Published in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018, Page(s) 1772-1781
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975031.116

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns

Author(s): Carbonnel, Clement; Cohen, David A.; Cooper, Martin C.; Zivny, Stanislav
Published in: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2018.19

The limits of SDP relaxations for general-valued CSPs

Author(s): Johan Thapper, Stanislav Zivny
Published in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Page(s) 1-12, ISBN 978-1-5090-3018-7
Publisher: IEEE
DOI: 10.1109/LICS.2017.8005087

The Complexity of Boolean Surjective General-Valued CSPs

Author(s): Peter Fulla, Stanislav Zivny
Published in: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 2017
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.MFCS.2017.4

The Tractability Frontier of Well-designed SPARQL Queries

Author(s): Miguel Romero
Published in: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - SIGMOD/PODS '18, 2018, Page(s) 295-306, ISBN 9781-450347068
Publisher: ACM Press
DOI: 10.1145/3196959.3196973

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

Author(s): Dusan Knop, Michal Pilipczuk, Marcin Wrochna
Published in: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019
Publisher: LIPICS
DOI: 10.4230/lipics.stacs.2019.44

The Complexity of General-Valued CSPs Seen from the Other Side

Author(s): Clement Carbonnel, Miguel Romero, Stanislav Zivny
Published in: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, Page(s) 236-246, ISBN 978-1-5386-4230-6
Publisher: IEEE
DOI: 10.1109/focs.2018.00031

Beyond Boolean Surjective VCSPs

Author(s): Gregor Matl Stanislav Zivny
Published in: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019
Publisher: LIPICS
DOI: 10.4230/lipics.stacs.2019.52

Sparsification of Binary CSPs

Author(s): Silvia Butti Stanislav Zivny
Published in: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019
Publisher: LIPICS
DOI: 10.4230/lipics.stacs.2019.17

Point-width and Max-CSPs

Author(s): Clement Carbonnel, Miguel Romero, Stanislav Zivny
Published in: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, Page(s) 1-13, ISBN 978-1-7281-3608-0
Publisher: IEEE
DOI: 10.1109/lics.2019.8785660

Approximate counting CSP seen from the other side

Author(s): Bulatov, Andrei A.; Zivny, Stanislav
Published in: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Issue 2, 2019, Page(s) 60:1--60:14
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2019.60

Boundedness of Conjunctive Regular Path Queries

Author(s): Barceló, Pablo; Figueira, Diego; Romero, Miguel
Published in: International Colloquium on Automata, Languages, and Programming (ICALP), Issue 1, 2019
Publisher: LIPICS
DOI: 10.4230/lipics.icalp.2019.104

Sallow: a heuristic algorithm for treedepth decompositions

Author(s): Wrochna, Marcin
Published in: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Issue 1, 2020, Page(s) 36:1--36:4
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.ipec.2020.36

CLAP: A New Algorithm for Promise CSPs

Author(s): Lorenzo Ciardo, Stanislav Zivny
Published in: Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022
Publisher: ACM
DOI: 10.1137/1.9781611977073.46

Galois Connections for Patterns: An Algebra of Labelled Graphs

Author(s): David Cohen, Martin Cooper, Peter Jeavons, Stanislav Živný
Published in: Graph Structures for Knowledge Representation and Reasoning, 2020
Publisher: Springer
DOI: 10.1007/978-3-030-72308-8_9

PTAS for sparse general-valued CSPs

Author(s): Balázs Mezei, Marcin Wrochna, Stanislav Živný
Published in: Logic in Computer Science, 2021
Publisher: IEEE
DOI: 10.1109/lics52264.2021.9470599

On Monotonic Determinacy and Rewritability for Recursive Queries and Views

Author(s): Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
Published in: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020, Page(s) 131-148, ISBN 9781450371087
Publisher: ACM
DOI: 10.1145/3375395.3387661

Book chapters (5)

Improved hardness for H -colourings of G -colourable graphs

Author(s): Marcin Wrochna, Stanislav Živný
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Page(s) 1426-1435, ISBN 978-1-61197-599-4
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.86

Integer Programming and Incidence Treedepth

Author(s): Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak, Michał Pilipczuk, Marcin Wrochna
Published in: Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings, Issue 11480, 2019, Page(s) 194-204, ISBN 978-3-030-17952-6
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-17953-3_15

The Complexity of Approximately Counting Retractions

Author(s): Jacob Focke, Leslie Ann Goldberg, Stanislav Živný
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 2205-2215, ISBN 978-1-61197-548-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.133

Treewidth-Pliability and PTAS for Max-CSPs

Author(s): Miguel Romero, Marcin Wrochna, Stanislav Živný
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 473-483, ISBN 978-1-61197-646-5
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.29

Counting Homomorphisms to K 4 -minor-free Graphs, modulo 2

Author(s): Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Živný
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 2303-2314, ISBN 978-1-61197-646-5
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.137