Skip to main content

Power of Algorithms in Discrete Optimisation

Searching for OpenAIRE data...

Publications

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
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
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
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
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
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
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
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
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
DOI: 10.1145/3329862

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
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
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
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
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
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
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
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
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
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
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
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
DOI: 10.4230/lipics.mfcs.2019.60

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
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
DOI: 10.1137/1.9781611975482.133