• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 127 matches

• 2025
• 
  Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi:
  Integer points in the degree-sequence polytope. Discret. Optim. 55: 100867 (2025)
• 2024
• 
  Friedrich Eisenbrand, Matthieu Haeberle, Neta Singer:
  An Improved Bound on Sums of Square Roots via the Subspace Theorem. SoCG 2024: 54:1-54:8
• 
  Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki:
  Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. FOCS 2024: 1610-1620
• 
  Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki:
  Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. CoRR abs/2404.03747 (2024)
• 
  Matthieu Haeberle, Puck van Gerwen, Rubén Laplaza, Ksenia R. Briling, Jan Weinreich, Friedrich Eisenbrand, Clémence Corminboeuf:
  Integer linear programming for unsupervised training set selection in molecular machine learning. CoRR abs/2410.16122 (2024)
• 2023
• 
  Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn:
  Reducibility bounds of objective functions over the integers. Oper. Res. Lett. 51(6): 595-598 (2023)
• 
  Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss:
  From Approximate to Exact Integer Programming. IPCO 2023: 100-114
• 
  Christoph Finkensiep, Matthieu Haeberle, Friedrich Eisenbrand, Markus Neuwirth, Martin Rohrmeier:
  Repetition-Structure Inference With Formal Prototypes. ISMIR 2023: 383-390
• 
  Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi:
  Integer points in the degree-sequence polytope. CoRR abs/2305.06732 (2023)
• 
  Friedrich Eisenbrand, Matthieu Haeberle, Neta Singer:
  An improved bound on sums of square roots via the subspace theorem. CoRR abs/2312.02057 (2023)
• 2022
• 
  Friedrich Eisenbrand, Moritz Venzin:
  Approximate CVP_p in time 2^0.802n. J. Comput. Syst. Sci. 124: 129-139 (2022)
• 
  Raimon Fabregat, Puck van Gerwen, Matthieu Haeberle, Friedrich Eisenbrand, Clémence Corminboeuf:
  Metric learning for kernel ridge regression: assessment of molecular similarity. Mach. Learn. Sci. Technol. 3(3): 35015 (2022)
• 
  Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss:
  From approximate to exact integer programming. CoRR abs/2211.03859 (2022)
• 2021
• 
  Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
  Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. ESA 2021: 33:1-33:14
• 
  Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder, Robert Weismantel:
  Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. SODA 2021: 1666-1681
• 
  Friedrich Eisenbrand, Martina Gallato, Ola Svensson, Moritz Venzin:
  A QPTAS for stabbing rectangles. CoRR abs/2107.06571 (2021)
• 2020
• 
  Friedrich Eisenbrand, Robert Weismantel:
  Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma. ACM Trans. Algorithms 16(1): 5:1-5:14 (2020)
• 
  Friedrich Eisenbrand, Moritz Venzin:
  Approximate CVP_p in Time 2^{0.802 n}. ESA 2020: 43:1-43:15
• 
  Jana Cslovjecsek, Friedrich Eisenbrand, Robert Weismantel:
  N-fold integer programming via LP rounding. CoRR abs/2002.07745 (2020)
• 
  Friedrich Eisenbrand, Moritz Venzin:
  Approximate $\mathrm{CVP}_{\infty}$ in time $2{0.802 \, n}$. CoRR abs/2005.04957 (2020)
• 
  Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
  Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. CoRR abs/2012.11742 (2020)
• 2019
• 
  Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen:
  An Improved Analysis of Local Search for Max-Sum Diversification. Math. Oper. Res. 44(4): 1494-1509 (2019)
• 
  Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn:
  An Algorithmic Theory of Integer Programming. CoRR abs/1904.01361 (2019)
• 2018
• 
  Iskander Aliev, Jesús A. De Loera, Friedrich Eisenbrand, Timm Oertel, Robert Weismantel:
  The Support of Integer Optimal Solutions. SIAM J. Optim. 28(3): 2152-2157 (2018)
• 
  Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein:
  Faster Algorithms for Integer Programs with Block Structure. ICALP 2018: 49:1-49:13
• 
  Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell:
  Diversity Maximization in Doubling Metrics. ISAAC 2018: 33:1-33:12
• 
  Friedrich Eisenbrand, Robert Weismantel:
  Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma. SODA 2018: 808-816
• 
  Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein:
  Faster Algorithms for Integer Programs with Block Structure. CoRR abs/1802.06289 (2018)
• 
  Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell:
  Diversity maximization in doubling metrics. CoRR abs/1809.09521 (2018)
• 2017
• 
  Friedrich Eisenbrand, Santosh S. Vempala:
  Geometric random edge. Math. Program. 164(1-2): 325-339 (2017)

skipping 97 more matches