E-LIB Suche - Ergebnisse für: Peis, Britta

1

A flow‐based ascending auction to compute buyer‐optimal Wal..:

Eickhoff, Katharina ; McCormick, S. Thomas ; Peis, Britta..
Networks. , 2024

Link: https://doi.org/10.1002/..

2

Stackelberg Vertex Cover on a Path:

, In: Algorithmic Game Theory; Lecture Notes in Computer Science,

Eickhoff, Katharina ; Kauther, Lennart ; Peis, Britta - p. 22-39 , 2023

Link: https://doi.org/10.1007/..

3

Combinatorial Algorithms for Covering and Scheduling Proble..:

Leichter, Marilena Susan , 2021

Link: http://nbn-resolving.de/..

4

Approximation and Online Algorithms: 19th International Wor..

Theoretical Computer Science and General Issues, 12982

Koenemann, Jochen ; Peis, Britta - 1st ed. 2021 . , 2021

Link: https://doi.org/10.1007/..

5

A Polynomial Time Algorithm for Solving the Closest Vector ..:

McCormick, S. Thomas ; Peis, Britta ; Scheidweiler, Robert.
SIAM Journal on Discrete Mathematics. 35 (2021) 4 - p. 2345-2356 , 2021

Link: https://doi.org/10.1137/..

6

Matroid bases with cardinality constraints on the intersect..:

Lendl, Stefan ; Peis, Britta ; Timmermans, Veerle
Mathematical Programming. 194 (2021) 1-2 - p. 661-684 , 2021

Link: https://doi.org/10.1007/..

7

In Memoriam Walter Kern:

Hochstättler, Winfried ; Hurink, Johann ; Manthey, Bodo...
Discrete Applied Mathematics. 303 (2021) - p. 2-3 , 2021

Link: https://doi.org/10.1016/..

8

Preface: 15th Cologne–Twente Workshop on Graphs and Combina..:

Peis, Britta ; Schaudt, Oliver ; Röglin, Heiko...
Discrete Applied Mathematics. 272 (2020) - p. 1 , 2020

Link: https://doi.org/10.1016/..

9

Additive stabilizers for unstable graphs:

Chandrasekaran, Karthekeyan ; Gottschalk, Corinna ; Könemann, Jochen...
Discrete Optimization. 31 (2019) - p. 56-78 , 2019

Link: https://doi.org/10.1016/..

10

WITHDRAWN: Preface: 15th Cologne–Twente Workshop on graphs ..:

Peis, Britta ; Schaudt, Oliver ; Röglin, Heiko...
Discrete Applied Mathematics. , 2019

Link: https://doi.org/10.1016/..

11

Flows over time and submodular function minimization:

Schlöter, Miriam , 2018

Link: https://nbn-resolving.de..

12

Sensitivity Analysis for Convex Separable Optimization Over..:

Harks, Tobias ; Klimm, Max ; Peis, Britta
SIAM Journal on Optimization. 28 (2018) 3 - p. 2222-2245 , 2018

Link: https://doi.org/10.1137/..

13

Competitive Packet Routing with Priority Lists:

Harks, Tobias ; Peis, Britta ; Schmand, Daniel..
ACM Transactions on Economics and Computation. 6 (2018) 1 - p. 1-26 , 2018

Link: https://doi.org/10.1145/..

14

Competitive Packet Routing with Priority Lists:

Harks, Tobias ; Peis, Britta ; Schmand, Daniel..
ACM Transactions on Economics and Computation (TEAC). 6 (2018) 1 - p. 1-26 , 2018

Link: https://dl.acm.org/doi/1..

15

Extensions of secretary problems towards submodular objecti..:

Tönnis, Andreas , 2017

Link: http://nbn-resolving.de/..