Leichter, Marilena;Moseley, Benjamin;Pruhs, Kirk
An Efficient Reduction of a Gammoid to a Partition Matroid
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2021

Eckl, Alexander;Kirschbaum, Anja;Leichter, Marilena;Schewior, Kevin
A stronger impossibility for fully online matching
Operations Research Letters
2021
49
5
802-808

Martin, Layla;Minner, Stefan;Poças, Diogo;Schulz, Andreas S.
The Competitive Pickup and Delivery Orienteering Problem for Balancing Car-Sharing Systems
Transp. Sci.
2021
55
6
1232--1259

Chalermsook, Parinya;Kaul, Matthias;Mnich, Matthias;Spoerhase, Joachim;Uniyal, Sumedha;Vaz, Daniel
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
CoRR
2021
abs/2111.06299

Chalermsook, Parinya;Das, Syamantak;Kook, Yunbum;Laekhanukit, Bundit;Liu, Yang P.;Peng, Richard;Sellke, Mark;Vaz, Daniel
Vertex Sparsification for Edge Connectivity
SODA
USA
SIAM
2021

Friesecke, Gero;Schulz, Andreas S.;Vögler, Daniela
Genetic column generation: Fast computation of high-dimensional multi-marginal optimal transport problems
Machine Learning
2021

Auzinger, Winfried;Březinová, Iva;Grosz, Alexander;Hofstätter, Harald;Koch, Othmar;Sato, Takeshi
Efficient adaptive exponential time integrators for nonlinear Schrödinger equations with nonlocal potential
Journal of Computational Mathematics and Data Science
2021
1
100014

Křetínský, Jan;Meggendorfer, Tobias;Waldmann, Clara;Weininger, Maximilian
Index appearance record with preorders
Acta Informatica
2021

Melissourgos, Themistoklis;Nikoletseas, Sotiris E.;Raptopoulos, Christoforos L.;Spirakis, Paul G.
An extension of the Moran process using type-specific connection graphs
Journal of Computer and System Sciences
2021

Akrida, Eleni C.;Deligkas, Argyrios;Melissourgos, Themistoklis;Spirakis, Paul G.
Connected Subgraph Defense Games
Algorithmica
2021
Aug