Friedrich Eisenbrand

Friedrich Eisenbrand

École Polytechnique Fédérale de Lausanne

H-index: 33

Europe-Switzerland

About Friedrich Eisenbrand

Friedrich Eisenbrand, With an exceptional h-index of 33 and a recent h-index of 18 (since 2020), a distinguished researcher at École Polytechnique Fédérale de Lausanne, specializes in the field of Computation, Mathematics.

His recent articles reflect a diverse array of research interests and contributions to the field:

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems

From approximate to exact integer programming

Integer points in the degree-sequence polytope

An improved bound on sums of square roots via the subspace theorem

Forall-exist statements in pseudopolynomial time

Repetition-Structure Inference With Formal Prototypes

Reducibility bounds of objective functions over the integers

Metric learning for kernel ridge regression: assessment of molecular similarity

Friedrich Eisenbrand Information

University

Position

___

Citations(all)

2894

Citations(since 2020)

1071

Cited By

2341

hIndex(all)

33

hIndex(since 2020)

18

i10Index(all)

63

i10Index(since 2020)

32

Email

University Profile Page

École Polytechnique Fédérale de Lausanne

Google Scholar

View Google Scholar Profile

Friedrich Eisenbrand Skills & Research Interests

Computation

Mathematics

Top articles of Friedrich Eisenbrand

Title

Journal

Author(s)

Publication Date

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems

arXiv preprint arXiv:2404.03747

Friedrich Eisenbrand

Lars Rohwedder

Karol Węgrzycki

2024/4/4

From approximate to exact integer programming

Mathematical Programming

Daniel Dadush

Friedrich Eisenbrand

Thomas Rothvoss

2024/4/24

Integer points in the degree-sequence polytope

arXiv preprint arXiv:2305.06732

Eleonore Bach

Friedrich Eisenbrand

Rom Pinchasi

2023/5/11

An improved bound on sums of square roots via the subspace theorem

arXiv preprint arXiv:2312.02057

Friedrich Eisenbrand

Matthieu Haeberle

Neta Singer

2023/12/4

Forall-exist statements in pseudopolynomial time

arXiv preprint arXiv:2311.07214

Eleonore Bach

Friedrich Eisenbrand

Robert Weismantel

2023/11/13

Repetition-Structure Inference With Formal Prototypes

Christoph Finkensiep

Matthieu Haeberle

Friedrich Eisenbrand

Markus Neuwirth

Martin Rohrmeier

2023/11/5

Reducibility bounds of objective functions over the integers

Operations Research Letters

Friedrich Eisenbrand

Christoph Hunkenschröder

Kim-Manuel Klein

Martin Koutecký

Asaf Levin

...

2023/11/1

Metric learning for kernel ridge regression: assessment of molecular similarity

Machine Learning: Science and Technology

Raimon Fabregat

Puck van Gerwen

Matthieu Haeberle

Friedrich Eisenbrand

Clémence Corminboeuf

2022/9/22

Approximate cvpp in time 20.802 n

Journal of Computer and System Sciences

Friedrich Eisenbrand

Moritz Venzin

2022/3/1

Block-structured integer and linear programming in strongly polynomial and near linear time

Jana Cslovjecsek

Friedrich Eisenbrand

Christoph Hunkenschröder

Lars Rohwedder

Robert Weismantel

2021

Tropical geometry and the geometry of linear programming

Yin Tat Lee Dadush

Stephen Wright

Jens Vygen

Friedrich Eisenbrand

Fedor Fomin

...

2021/9/20

A QPTAS for stabbing rectangles

arXiv preprint arXiv:2107.06571

Friedrich Eisenbrand

Martina Gallato

Ola Svensson

Moritz Venzin

2021/7/14

Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity

Arnold Meijster

2004

Approximate in time

arXiv preprint arXiv:2005.04957

Friedrich Eisenbrand

Moritz Venzin

2020/5/11

See List of Professors in Friedrich Eisenbrand University(École Polytechnique Fédérale de Lausanne)