Publications

These publications are managed in Infoscience. To add a new publication, go to https://infoscience.epfl.ch/youraccount/login?ln=en&referer=https://infoscience.epfl.ch/submit?ln=en.

Integer Linear Programming for Unsupervised Training Set Selection in Molecular Machine Learning

M. Haeberle; P. van Gerwen; R. Laplaza; K. R. Briling; J. Weinreich et al. 

MACHINE LEARNING-SCIENCE AND TECHNOLOGY. 2025. Vol. 6, num. 2. DOI : 10.1088/2632-2153/adcd38.

Detailed record

View at publisher

Better Approximation for Weighted 𝑘-Matroid Intersection

N. Singer; T. Thiery 

2025. 57th Annual ACM Symposium on Theory of Computing (STOC 2025), Prague, Czechia, 2025-06-23 – 2025-06-27. p. 1142 – 1153. DOI : 10.1145/3717823.3718219.

Detailed record

View at publisher

Integer points in the degree-sequence polytope

E. Bach; F. Eisenbrand; R. Pinchasi 

DISCRETE OPTIMIZATION. 2025. Vol. 55. DOI : 10.1016/j.disopt.2024.100867.

Detailed record

View at publisher

Forall-exist statements in pseudopolynomial time

E. Bach; F. Eisenbrand; T. Rothvoß; R. Weismantel 

2025. 2025 ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, US, 2025-01-12 – 2025-01-15. p. 2225 – 2233. DOI : 10.1137/1.9781611978322.73.

Detailed record

View at publisher

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems

F. Eisenbrand; L. Rohwedder; K. Węgrzycki 

2024. 65th Annual Symposium on Foundations of Computer Science, Chicago, United States, 2024-10-27 – 2024-10-30. p. 1610 – 1620. DOI : 10.1109/focs61266.2024.00100.

Detailed record

View at publisher

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

R. Pinchasi 

Electronic Journal Of Combinatorics. 2024. Vol. 31, num. 2, p. 1 – 11. DOI : 10.37236/12054.

Detailed record

View at publisher

An Improved Bound on Sums of Square Roots via the Subspace Theorem

F. Eisenbrand; M. Haeberle; N. Singer 

2024. 40 International Symposium on Computational Geometry, Athens, Greece, 2024-06-11 – 2024-06-14. DOI : 10.4230/LIPIcs.SoCG.2024.54.

Detailed record

View at publisher

From approximate to exact integer programming

D. Dadush; F. Eisenbrand; T. Rothvoss 

Mathematical Programming. 2024.  p. s10107 – 024. DOI : 10.1007/s10107-024-02084-1.

Detailed record

View at publisher

Reducibility bounds of objective functions over the integers

F. Eisenbrand; C. Hunkenschroeder; K-M. Klein; M. Koutecky; A. Levin et al. 

Operations Research Letters. 2023. Vol. 51, num. 6, p. 595 – 598. DOI : 10.1016/j.orl.2023.10.001.

Detailed record

View at publisher

Results on Sparse Integer Programming and Geometric Independent Sets

J. T. Cslovjecsek / F. Eisenbrand (Dir.)  

Lausanne, EPFL, 2023. 

Detailed record

View at publisher

ON THE INDEPENDENCE NUMBER OF INTERSECTION GRAPHS OF AXIS-PARALLEL SEGMENTS

M. Caoduro; J. T. Cslovjecsek; M. Pilipczuk; K. Wegrzycki 

Journal Of Computational Geometry. 2023. Vol. 14, num. 1, p. 144 – 156. DOI : 10.20382/jocg.v14i1a5.

Detailed record

View at publisher

Geometric Considerations in Lattice Programming

M. A. Venzin / F. Eisenbrand (Dir.)  

Lausanne, EPFL, 2023. 

Detailed record

View at publisher

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

K. Jansen; K-M. Klein; A. Lassota 

Mathematical Programming. 2022. DOI : 10.1007/s10107-022-01837-0.

Detailed record

View at publisher

Covering Convex Bodies and the Closest Vector Problem

M. Naszódi; M. A. Venzin 

Discrete & Computational Geometry. 2022. Vol. 67, num. 4, p. 1191 – 1210. DOI : 10.1007/s00454-022-00392-x.

Detailed record

View at publisher

Approximate CVPp in time 2(0.802n)

F. Eisenbrand; M. Venzin 

Journal Of Computer And System Sciences. 2022. Vol. 124, p. 129 – 139. DOI : 10.1016/j.jcss.2021.09.006.

Detailed record

View at publisher

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

A. Berger; W. Kuszmaul; A. T. Polak; J. Tidor; N. Wein 

2022. 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Paris, France, July 4-8, 2022. p. 19:1 – . DOI : 10.4230/lipics.icalp.2022.19.

Detailed record

View at publisher

The covering radius and a discrete surface area for non-hollow simplices

G. Codenotti; F. Santos; M. Schymura 

Discrete & Computational Geometry. 2022. Vol. 67, p. 65 – 111. DOI : 10.1007/s00454-021-00330-3.

Detailed record

View at publisher

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

A. Lassota; A. Łukasiewicz; A. Polak 

2022. 49th International Colloquium on Automata, Languages, and Programming, Paris, France, July 4-8, 2022. p. 87:1 – 87:15. DOI : 10.4230/lipics.icalp.2022.87.

Detailed record

View at publisher

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

J. Cslovjecsek; F. Eisenbrand; M. Pilipczuk; M. A. Venzin; R. Weismantel 

2021. 29th Annual European Symposium on Algorithms (ESA 2021), Lisbon, Portugal (Virtual Conference), September 6-8, 2021. p. 33:1 – . DOI : 10.4230/lipics.esa.2021.33.

Detailed record

View at publisher

Nearly-Tight and Oblivious Algorithms for Explainable Clustering

B. Gamlath; X. Jia; A. T. Polak; O. N. A. Svensson 

2021. 35th Conference on Neural Information Processing Systems, NeurIPS 2021, virtual, December 6-14, 2021. p. 28929 – 28939.

Detailed record