Power of Algorithms in Discrete Optimisation

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

Auteurs: Dušan Knop, Michał Pilipczuk, Marcin Wrochna
Publié dans: ACM Transactions on Computation Theory, 2020, ISSN 1942-3454
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3397484

Sparsification of Binary CSPs

Auteurs: Silvia Butti and Stanislav Živný
Publié dans: SIAM Journal on Discrete Mathematics, 2020, ISSN 0895-4801
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1242446

On rainbow-free colourings of uniform hypergraphs

Auteurs: Ragnar Groot Koerkamp; Stanislav Živný
Publié dans: Theoretical Computer Science, 2021, ISSN 0304-3975
Éditeur: Elsevier BV
DOI: 10.1016/j.tcs.2021.06.022

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

Auteurs: Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Živný
Publié dans: Journal of Computer and System Sciences, Numéro 109, 2020, Page(s) 95-125, ISSN 0022-0000
Éditeur: 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

Auteurs: Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, Stanislav Živný
Publié dans: SIAM Journal on Computing, 2020, ISSN 0097-5397
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1312745

QCSP on Reflexive Tournaments

Auteurs: Benoît Larose, Petar Marković, Barnaby Martin, Daniël Palusma, Sani Smith,Stanislav Živný
Publié dans: ACM Transaction on Computational Logic, 2022, ISSN 1529-3785
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3508069

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

Auteurs: Gregor Matl, Stanislav Živný
Publié dans: Algorithmica, Numéro 82/12, 2020, Page(s) 3492-3520, ISSN 0178-4617
Éditeur: Springer Verlag
DOI: 10.1007/s00453-020-00735-1

The Complexity of Approximately Counting Retractions

Auteurs: Jacob Focke; Leslie Ann Goldberg; Stanislav Živný
Publié dans: ACM Transactions on Computation Theory, 2020, ISSN 1942-3454
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3397472

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

Auteurs: Jacob Focke; Leslie Ann Goldberg; Marc Roth; Stanislav Živný
Publié dans: Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2, 2021, ISSN 0895-4801
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/20m1382921

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

Auteurs: Caterina Viola, Stanislav Zivny
Publié dans: ACM Transactions on Algorithms, 2021, ISSN 1549-6325
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3458041

Binary constraint satisfaction problems defined by excluded topological minors

Auteurs: David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Živný
Publié dans: Information and Computation, Numéro 264, 2019, Page(s) 12-31, ISSN 0890-5401
Éditeur: Academic Press
DOI: 10.1016/j.ic.2018.09.013

Steepest ascent can be exponential in bounded treewidth problems

Auteurs: David A. Cohen, Martin C. Cooper, Artem Kaznatcheev, Mark Wallace
Publié dans: Operations Research Letters, Numéro 48/3, 2020, Page(s) 217-224, ISSN 0167-6377
Éditeur: Elsevier BV
DOI: 10.1016/j.orl.2020.02.010

The local-global property for G-invariant terms

Auteurs: Kazda, Alexandr; Kompatscher, Michael
Publié dans: International Journal of Algebra and Computation, 2022, ISSN 0218-1967
Éditeur: World Scientific Publishing Co
DOI: 10.1142/s0218196722500527

Point-Width and Max-CSPs

Auteurs: Clement Carbonnel, Miguel Romero, Stanislav Zivny
Publié dans: ACM Transactions on Algorithms, 2020, ISSN 1549-6325
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3409447

Discrete convexity in joint winner property

Auteurs: Yuni Iwamasa, Kazuo Murota, Stanislav Živný
Publié dans: Discrete Optimization, Numéro 28, 2018, Page(s) 78-88, ISSN 1572-5286
Éditeur: Elsevier BV
DOI: 10.1016/j.disopt.2018.01.001

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

Auteurs: Martin C. Cooper and Stanislav Zivny
Publié dans: Logical Methods in Computer Science, 2017, ISSN 1860-5974
Éditeur: Technischen Universitat Braunschweig
DOI: 10.23638/LMCS-13(4:26)2017

Binarisation for Valued Constraint Satisfaction Problems

Auteurs: David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei Krokhin, Robert Powell, Stanislav Živný
Publié dans: SIAM Journal on Discrete Mathematics, Numéro 31/4, 2017, Page(s) 2279-2300, ISSN 0895-4801
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/16M1088107

Functional clones and expressibility of partition functions

Auteurs: Andrei Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Živný
Publié dans: Theoretical Computer Science, Numéro 687, 2017, Page(s) 11-39, ISSN 0304-3975
Éditeur: Elsevier BV
DOI: 10.1016/j.tcs.2017.05.001

On planar valued CSPs

Auteurs: Peter Fulla, Stanislav Živný
Publié dans: Journal of Computer and System Sciences, Numéro 87, 2017, Page(s) 104-118, ISSN 0022-0000
Éditeur: Academic Press
DOI: 10.1016/j.jcss.2017.03.005

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

Auteurs: Johan Thapper, Stanislav Živný
Publié dans: SIAM Journal on Computing, Numéro 46/4, 2017, Page(s) 1241-1279, ISSN 0097-5397
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/16M1079245

The Limits of SDP Relaxations for General-Valued CSPs

Auteurs: Johan Thapper, Stanislav Živný
Publié dans: ACM Transactions on Computation Theory, Numéro 10/3, 2018, Page(s) 1-22, ISSN 1942-3454
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3201777

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns

Auteurs: Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Živný
Publié dans: Algorithmica, Numéro 81/4, 2019, Page(s) 1699-1727, ISSN 0178-4617
Éditeur: Springer Verlag
DOI: 10.1007/s00453-018-0498-2

A Tractable Class of Binary VCSPs via M-Convex Intersection

Auteurs: Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Živný
Publié dans: ACM Transactions on Algorithms, Numéro 15/3, 2019, Page(s) 1-41, ISSN 1549-6325
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3329862

The Complexity of Promise SAT on Non-Boolean Domains

Auteurs: Alex Brandts, Marcin Wrochna, Stanislav Zivny
Publié dans: ACM Transactions on Computation Theory, 2021, ISSN 1942-3454
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3470867

A More General Theory of Static Approximations for Conjunctive Queries

Auteurs: Pablo Barceló, Miguel Romero, Thomas Zeume
Publié dans: Theory of Computing Systems, Numéro 64/5, 2020, Page(s) 916-964, ISSN 1432-4350
Éditeur: Springer Verlag
DOI: 10.1007/s00224-019-09924-0

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

Auteurs: Clément Carbonnel, Miguel Romero, and Stanislav Živný
Publié dans: SIAM Journal on Computing, 2022, ISSN 0097-5397
Éditeur: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1250121

The Complexity of Approximately Counting Retractions to Square-free Graphs

Auteurs: Jacob Focke, Leslie Ann Goldberg, Stanislav Zivny
Publié dans: ACM Transactions on Algorithms, 2021, ISSN 1549-6325
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3458040

Approximate Counting CSP Seen from the Other Side

Auteurs: Andrei Bulatov and Stanislav Živný
Publié dans: ACM Transactions on Computation Theory, 2020, ISSN 1942-3454
Éditeur: Association for Computing Machinary, Inc.
DOI: 10.1145/3389390

Additive Sparsification of CSPs

Auteurs: Eden Pelleg and Stanislav Zivny
Publié dans: European Symposium on Algorithms, 2021
Éditeur: Dagstuhl
DOI: 10.4230/lipics.esa.2021.75

Beyond PCSP (1-in-3,NAE)

Auteurs: Brandts, Alex; Živný, Stanislav
Publié dans: Proceedings of ICALP, 2021
Éditeur: Dagstuhl
DOI: 10.4230/lipics.icalp.2021.121

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

Auteurs: Viola, Caterina; Živný, Stanislav
Publié dans: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Numéro 1, 2020, Page(s) 85:1--85:15
Éditeur: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.mfcs.2020.85

The complexity of promise SAT on non-Boolean domains

Auteurs: Brandts, Alex; Wrochna, Marcin; Živný, Stanislav
Publié dans: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Numéro 1, 2020, Page(s) 17:1--17:13
Éditeur: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.icalp.2020.17

QCSP on Reflexive Tournaments

Auteurs: Benoît Larose and Petar Marković and Barnaby Martin and Daniël Palusma and Siani Smith and Stanislav Živný
Publié dans: European Symposium on Algorithms, 2021
Éditeur: Dagstuhl
DOI: 10.4230/lipics.esa.2021.58

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations

Auteurs: Jacob Focke,Leslie Ann Goldberg, Marc Roth, Stanislav Zivny
Publié dans: Symposium on Principles of Database Systems, 2022
Éditeur: ACM
DOI: 10.1145/3517804.3526231

Linearly ordered colourings of hypergraphs

Auteurs: Tamio-Vesa Nakajima, Stanislav Zivny
Publié dans: Proceedings of ICALP, 2022
Éditeur: Dagstuhl
DOI: 10.4230/lipics.icalp.2022.128

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

Auteurs: Hirai, Hiroshi ; Iwamasa, Yuni ; Murota, Kazuo ; Zivny, Stanislav
Publié dans: 2018
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2018.39

The Complexity of Counting Surjective Homomorphisms and Compactions

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

On Singleton Arc Consistency for CSPs Defined by Monotone Patterns

Auteurs: Carbonnel, Clement; Cohen, David A.; Cooper, Martin C.; Zivny, Stanislav
Publié dans: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2018.19

The limits of SDP relaxations for general-valued CSPs

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

The Complexity of Boolean Surjective General-Valued CSPs

Auteurs: Peter Fulla, Stanislav Zivny
Publié dans: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 2017
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.MFCS.2017.4

The Tractability Frontier of Well-designed SPARQL Queries

Auteurs: Miguel Romero
Publié dans: 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
Éditeur: ACM Press
DOI: 10.1145/3196959.3196973

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

Auteurs: Dusan Knop, Michal Pilipczuk, Marcin Wrochna
Publié dans: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019
Éditeur: LIPICS
DOI: 10.4230/lipics.stacs.2019.44

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

Auteurs: Clement Carbonnel, Miguel Romero, Stanislav Zivny
Publié dans: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, Page(s) 236-246, ISBN 978-1-5386-4230-6
Éditeur: IEEE
DOI: 10.1109/focs.2018.00031

Beyond Boolean Surjective VCSPs

Auteurs: Gregor Matl Stanislav Zivny
Publié dans: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019
Éditeur: LIPICS
DOI: 10.4230/lipics.stacs.2019.52

Sparsification of Binary CSPs

Auteurs: Silvia Butti Stanislav Zivny
Publié dans: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019
Éditeur: LIPICS
DOI: 10.4230/lipics.stacs.2019.17

Point-width and Max-CSPs

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

Approximate counting CSP seen from the other side

Auteurs: Bulatov, Andrei A.; Zivny, Stanislav
Publié dans: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Numéro 2, 2019, Page(s) 60:1--60:14
Éditeur: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2019.60

Boundedness of Conjunctive Regular Path Queries

Auteurs: Barceló, Pablo; Figueira, Diego; Romero, Miguel
Publié dans: International Colloquium on Automata, Languages, and Programming (ICALP), Numéro 1, 2019
Éditeur: LIPICS
DOI: 10.4230/lipics.icalp.2019.104

Sallow: a heuristic algorithm for treedepth decompositions

Auteurs: Wrochna, Marcin
Publié dans: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Numéro 1, 2020, Page(s) 36:1--36:4
Éditeur: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.ipec.2020.36

CLAP: A New Algorithm for Promise CSPs

Auteurs: Lorenzo Ciardo, Stanislav Zivny
Publié dans: Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022
Éditeur: ACM
DOI: 10.1137/1.9781611977073.46

Galois Connections for Patterns: An Algebra of Labelled Graphs

Auteurs: David Cohen, Martin Cooper, Peter Jeavons, Stanislav Živný
Publié dans: Graph Structures for Knowledge Representation and Reasoning, 2020
Éditeur: Springer
DOI: 10.1007/978-3-030-72308-8_9

PTAS for sparse general-valued CSPs

Auteurs: Balázs Mezei, Marcin Wrochna, Stanislav Živný
Publié dans: Logic in Computer Science, 2021
Éditeur: IEEE
DOI: 10.1109/lics52264.2021.9470599

On Monotonic Determinacy and Rewritability for Recursive Queries and Views

Auteurs: Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
Publié dans: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020, Page(s) 131-148, ISBN 9781450371087
Éditeur: ACM
DOI: 10.1145/3375395.3387661

Improved hardness for H -colourings of G -colourable graphs

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

Integer Programming and Incidence Treedepth

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

The Complexity of Approximately Counting Retractions

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

Treewidth-Pliability and PTAS for Max-CSPs

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

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

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

Publications

Partager cette page Partager cette page sur les réseaux sociaux

Télécharger Télécharger le contenu de la page