Publications related to Polychromatic colorings of arbitrary rectangular partitions

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...

Springer2023

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n.Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed p ...

EPFL2023

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Maryam Kamgarpour, Tony Alan Wood

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

2023

The double exponential runtime is tight for 2-stage stochastic ILPs

Kim-Manuel Klein, Klaus Jansen, Alexandra Anna Lassota

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

SPRINGER HEIDELBERG2022

Minimum Cost Intervention Design for Causal Effect Identification

Negar Kiyavash, Sina Akbari, Seyed Jalal Etesami

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...

PMLR2022

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

Oliver Kröcher, Frédéric Vogel, David Baudouin, Ayush Agarwal

Ru/CNF catalysts of different Ru nanoparticle (NP) sizes (0.9-2.7 nm) were assessed for their performance in continuous supercritical water gasification (SCWG) of glycerol. A structure sensitivity of Ru was demonstrated, with high initial turnover frequenc ...

2022

Automating cutting planes is NP-hard

Mika Tapani Göös

We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula F, It is -hard to find a CP refutation of F in time polynomial in the length of the shortest such refutation; and unless Gap-Hitting-Set admits a nontrivial algorithm, ...

ACM2021

Bayesian Decision Making in Groups is Hard

Jan Hazla

We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions that maximize their expected utility according to a fully rational posterior be ...

INFORMS2021

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Qi Yan, Li Jiang

This letter studies the measurement scheduling problem for a group of

N

mobile robots moving on a flat surface that are preforming cooperative localization (CL). We consider a scenario in which due to the limited on-board resources such as battery life a ...

2020

Sparsity Invariance for Convex Design of Distributed Controllers

Maryam Kamgarpour, Luca Furieri, Yu Zheng

We address the problem of designing optimal linear time-invariant (LTI) sparse controllers for LTI systems, which corresponds to minimizing a norm of the closed-loop system subjected to sparsity constraints on the controller structure. This problem is NP-h ...

2020

Polychromatic colorings of arbitrary rectangular partitions

Graph Chatbot

Chat with Graph Search

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Results on Sparse Integer Programming and Geometric Independent Sets

Certification of Bottleneck Task Assignment With Shortest Path Criteria

The double exponential runtime is tight for 2-stage stochastic ILPs

Minimum Cost Intervention Design for Causal Effect Identification

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

Automating cutting planes is NP-hard

Bayesian Decision Making in Groups is Hard

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Sparsity Invariance for Convex Design of Distributed Controllers

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Results on Sparse Integer Programming and Geometric Independent Sets

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Minimum Cost Intervention Design for Causal Effect Identification

Sparsity Invariance for Convex Design of Distributed Controllers

The double exponential runtime is tight for 2-stage stochastic ILPs

Particle Size Effects in Ru/CNF Catalysts during Supercritical Water Gasification of Glycerol

Automating cutting planes is NP-hard

Bayesian Decision Making in Groups is Hard

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions