Easy read
Login
Online-Services
Faculties / Central Institutes
DE / EN
TEACHING
PROJECTS
PUBLICATIONS
PEOPLE
To top

Research Seminar

The DISCOGA Research Seminar is a joint seminar with the Discrete Optimization Group of Max Klimm at TUB. Speakers might talk about their own research, present open problems, give a survey about a specific topic, present a recent paper by other authors, or anything else that is interesting for the participating groups.

usual Time: Wednesday 11:15
usual Room: MA 666
Contact Martin Knaack for questions, suggestions, Zoom links, etc.

Past and Upcoming Talks

DateTitleSpeaker
16.07.2025Algorithmic Results for Bounded-Density Edge Deletion via Generalized Flows and MatchingsTom-Lukas Breitkopf (AKT)
09.07.2025Online Makespan Scheduling under ScenariosEkin Ergen (COGA)
18.06.2025A Little Clairvoyance Is All You Need: Scheduling with Progress BarsAlexander Lindermayr (Universität Bremen)
28.05.2025The Power of Proportional Fairness for Non-clairvoyant Polytope SchedulingSven Jäger
21.05.2025Generalized Assignment and Knapsack Problems in the Random-Order ModelMartin Knaack (DISCO)
14.05.2025Parameterized Complexity of Segment RoutingAndré Nichterlein (AKT)
30.04.2025On Integer Multiflows and Cut ConditionsMartin Skutella (COGA)
23.04.2025New Combinatorial Insights for Monotone ApportionmentJavier Cembrano (MPI-INF)
09.04.2025A Tight O(3/2+ε)-Approximation Algorithm for Demand Strip PackingFranziska Eberle (COGA&DISCO)
02.04.2025Decomposition Polyhedra of Piecewise Linear FunctionsMoritz Grillo (COGA)
12.03.2025Unsplittable transshipmentsSrinwanti Debgupta (COGA)
26.02.2025Matching Augmentation in Demand-Aware NetworksArash Pourdamghani (TU Berlin)
11.12.2024Valid Cuts for the Design of Potential-based Flow NetworksLea Strubberg (DISCO)
11.12.2024Introduction to (Node-)ScanwidthSebastian Bruchhold (COGA&DISCO)
27.11.2024Packing a Knapsack with Items Owned by Strategic AgentsMartin Knaack (DISCO)
13.11.2024Generalized worst-case instances for the simplex algorithm using games on graphsMatthew Maat (UT-EEMCS)
18.07.2024Approximation of binary second-order cone programs of packing typeMax Klimm (DISCO)
11.07.2024Set Selection with Uncertain Weights: Non-Adaptive Queries and ThresholdsArturo Merino (Universidad de O’Higgins)
04.07.2024Fixed Order Routing and other souvenirs from KoldingEkin Ergen (COGA)
27.06.2024A First Order Method for Linear Programming Parameterized by Circuit ImbalanceChristoph Hertrich
13.05.2024Complexity of Deciding Injectivity and Surjectivity of ReLU Neural NetworksMoritz Grillo (COGA)
06.05.2024Destroying Densest Subgraphs is HardAndré Nichterlein (AKT)
29.04.2024Recovering potential-based flow networks during operations and under uncertaintyLea Strubberg (DISCO)
19.03.2024O(1/ε) Is the Answer in Online Weighted Throughput MaximizationFranziska Eberle (COGA&DISCO)
05.03.2024I.I.D. Prophet Inequalities from SamplesFelix Fischer (Queen Mary University of London)
27.02.2024Impartial rank aggregationJavier Cembrano (DISCO)
20.02.2024Disbalance of Machines in Total Completion Time Scheduling Under ScenariosEkin Ergen (COGA)
23.01.2024The Secretary Problem with Independent SamplingTim Oosterwijk (VU Amsterdam)
19.12.2023Decomposing Probability Marginals Beyond Affine RequirementsJannik Matuschke (KU Leuven)
12.12.2023Searching for infections in (Un)certain GraphsJosé Verschae (Pontificia Universidad Católica de Chile)
28.11.2023Deterministic Impartial Selection with WeightsSvenja Griesbach (DISCO)
14.11.2023Determinantal sievingTomohiro Koana (AKT)
07.11.2023Properties of equilibria in dynamic agent-based traffic modelsTheresa Ziemke (COGA)
31.10.2023A Brief Journey Through ProportionalityJannik Peters (TU Berlin)
17.10.2023On Pairwise Graph ConnectivityTobias Hofmann (COGA&DISCO)
18.07.2023Symmetric RDV on the line: Markov Strategy with Lookahead and Randomized OffsetFlorian Oubaha (Internship)
04.07.2023Complexity of equilibria in binary public goods games on undirected graphsMaximilian Stahlberg (DISCO)
27.06.2023Price of Stability of the Shapley Network Formation GameAlice Pain (Internship)
20.06.2023Transshipments Over Time and Submodular FunctionsMartin Skutella (COGA)
13.06.2023Information Design for Congestion Games with Unknown DemandSvenja Griesbach (DISCO)
06.06.2023Improved Bounds for Single-Nomination Impartial SelectionJavier Cembrano (DISCO)
30.05.2023Spatiotemporal reconstruction of ancient road networksMaximilian Stahlberg (DISCO)
23.05.2023News from the Workshop on Multi-Agent SystemsMax Klimm (DISCO)
16.05.2023Total completion time scheduling under scenariosEkin Ergen (COGA)
02.05.2023Coupling Models for Cardiac Electrophysiology with transparent interface conditionsLea Strubberg (DISCO)
21.02.2023Topological Expressive Power of ReLU Neural NetworksMoritz Grillo (COGA)
14.02.2023Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant SchedulingPhilipp Warode (HU Berin) and Guillaume Sagnol (COGA)
07.02.2023The Polyhedral Geometry of Truthful AuctionsSylvain Spitz (DISCO)
17.01.2023Souvenirs from AussoisEkin Ergen (COGA)
13.12.2022Training Fully Connected Neural Networks is ∃R-CompleteChristoph Hertrich (LSE)
06.12.2022Incremental Optimization of Potential Based FlowsAnnette Lutz (TU Darmstadt)
22.11.2022Improved Approximation Algorithms for the Expanding Search ProblemSvenja Griesbach (DISCO)
15.11.2022A Note on the Quickest Minimum Cost Transshipment ProblemMartin Skutella (COGA)
08.11.2022How bad is Farthest Insertion?Ekin Ergen (COGA)
01.11.2022Dynamic Programming and Semi-CoalgebrasMoritz Grillo (COGA)
25.10.2022Optimal Impartial CorrespondencesJavier Cembrano (DISCO)
18.10.2022Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack ConstraintMartin Knaack (DISCO)
12.07.2022Single Source Unsplittable Flows and their Application in Machine SchedulingSarah Morell (COGA)
12.07.2022On Minimizing the Weighted Number of Late JobsDimas Arsaputra
05.07.2022Public Signals in Network Congestion GamesSvenja Griesbach (DISCO)
28.06.2022Generalized Perron Roots and Solvability of the Absolute Value EquationManuel Radons (TU Berlin)
14.06.2022Impartial Selection with Additive Guarantees via Iterated DeletionJavier Cembrano (DISCO)
07.06.2022Gomory-Hu Trees on Special Classes of Parametric GraphsMargarete Wohlleber
31.05.2022Equilibria in Multiclass and Multidimensional Atomic Congestion GamesMax Klimm (DISCO)
17.05.2022From Combinatorial Optimization to Gray codesArturo Merino (COGA)
10.05.2022Lower Bounds for Approximation Algorithms for the Steiner Tree ProblemEkin Ergen (COGA)
26.04.2022Parametric Min Cut ComplexityTom McCormick
19.04.2022Connectivity thresholds in random temporal graphsMalte Renken (TU Berin)
09.03.2022A time-expanded Knapsack Problem with quadratic constraintsChiara Fusar Bassini
15.12.2021Machine-Learned Prediction Equilibrium for Dynamic Traffic AssignmentTobias Harks (Uni Augsburg)
15.12.2021Training Neural Networks is even harderLinda Kleist (TU Braunschweig)
08.12.2021Convergence of a Packet Routing Model to Flows Over TimeLaura Vargas Koch (ETH Zürich)
01.12.2021Optimisation with Squared Lasso PenaltyValentin Kirchner (TU Berlin)
24.11.2021Efficient generation of elimination trees and Hamilton paths on graph associahedraArturo Merino (COGA)
17.11.2021Book Embeddings of Nonplanar Graphs with Small Faces in Few PagesSvenja Griesbach (DISCO)
10.11.2021Fractionally Subadditive Maximization under an Incremental Knapsack ConstraintDavid Weckbecker (TU Darmstadt)
10.11.2021Stochastic Probing with Increasing PrecisionKevin Schewior (Uni Köln)
27.10.2021Evaluating the Potential of Reinforcement Learning for Stochastic Machine Scheduling ProblemsMohammed Majthoub Almoghrabi (COGA)
20.10.2021Multidimensional Apportionment through Discrepancy TheoryJavier Cembrano (DISCO)
13.10.2021Additive approximation schemes for load balancing problemsMoritz Buchem (Maastricht University)
21.09.2021An Algorithm-Independent Measure of Progress for Linear Constraint PropagationBoro Sofranac (IOL)
14.09.2021Combinatorial Diameter of Random PolyhedraSophie Huiberts
17.08.2021A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton MethodKhai Van Tran (COGA)
20.07.2021Computational experiments and multiscale optimizationFrieder Smolny (COGA)
06.07.2021Restricted Adaptivity in Stochastic SchedulingDaniel Schmidt genannt Waldschmidt (COGA)
22.06.2021Evolution of BoostingMax-Georg Schorr (IOL)
15.06.2021Nash flows over time in MATSim?Theresa Ziemke (COGA)
08.06.2021Greedy strategies for exhaustive generationArturo Merino (COGA)
25.05.2021Borsuk’s problemPaco Criado (IOL)
11.05.2021Tackling Neural Network Expressivity via (virtual Newton) polytopesChristoph Hertrich (COGA)
25.03.2021A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobsMartin Skutella (COGA)
18.03.2021Static and dynamic pricing of identical itemsMax Klimm (DISCO)
18.03.2021Robust conic optimization in PythonMaximilian Stahlberg (DISCO)
11.03.2021Set Curvature in Machine LearningThomas Kerdreux (IOL)
11.03.2021Differential Privacy for Machine LearningValentin Hartmann (EPFL)
04.03.2021Scheduling under Contact Restrictions - A Problem Arising in PandemicsDaniel Schmidt genannt Waldschmidt (COGA)
18.02.2021Greedy Batch-SchedulingGuillaume Sagnol (COGA)
04.02.2021Differentiable Optimization & Integration within Differentiable ProgrammingMathieu Besançon (IOL)
28.01.2021Online Scheduling of Deterministic and Stochastic Jobs on Unrelated MachinesSven Jäger (COGA)
21.01.2021Parametric Computation of Minimum Cost FlowsPhilipp Warode (DISCO)
14.01.2021Robust Optimization and LearningKartikey Sharma (IOL)
14.01.2021Neural Network Approximation TheoryShpresim Sadiku (IOL)
07.01.2021Contractibility vs CollapsibilityDavide Lofano (COGA)
17.12.2020Efficient generation of rectangulations via permutation languagesArturo Merino (COGA)
10.12.2020Accelerating Domain Propagation: an Efficient GPU-Parallel Algorithm over Sparse MatricesBoro Sofranac (IOL)
03.12.2020Local Acceleration of Conditional GradientsAlejandro Carderera (IOL, Georgia Tech)
26.11.2020Multidimensional Packing under Convex Quadratic ConstraintsRico Raber (COGA)
19.11.2020Learning Relations From Data With Conditional GradientsElias Wirth (IOL)
17.11.2020Understanding Neural Network Decisions is Hard - From Probabilistic Prime Implicants to Arc BendingStephan Wäldchen (TU Berlin)
12.11.2020The artification of the so-called A.I. art and the creative industryThomas Kerdreux (IOL)
12.11.2020Improved Bounds on the Competitive Ratio for Symmetric Rendezvous-on-the-Line with Unknown Initial DistanceKhai Van Tran (COGA)
05.11.2020Computing the Maximum Function with ReLU Neural NetworksChristoph Hertrich (COGA)
27.10.2020Frank-Wolfe with New and Practical Descent DirectionsCyrille Combettes (IOL, Georgia Tech)
09.10.2020Komplexität und Berechenbarkeit von robusten Schnitten in GraphenSebastian Ortmanns
25.06.2020On the two-dimensional knapsack problem for convex polygonsArturo Merino
12.06.2020Screening rules for Lasso and Optimal DesignsGuillaume Sagnol
05.06.2020Non-Clairvoyant Precedence Constrained SchedulingSven Jäger
26.05.2020Minimum-cost integer circulations in given homology classesSarah Morell
19.05.2020The Santa Claus ProblemDaniel Schmidt genannt Waldschmidt
05.05.2020Multi-commodity Nash flowsLeon Sering
28.04.2020The Maximum Leaf Spanning Tree Problem on Grid GraphsKarl Däubel
21.04.2020Derandomizing Unconstrained Submodular Function MaximizationKhai Van Tran
14.04.2020Representation Benefits of Deep Feedforward NetworksChristoph Hertrich
07.04.2020On the Robustness of Potential-Based Flow NetworksRico Raber
31.03.2020Some Aspects of Graph Sparsification in Theory and PracticeKarl Däubel
03.03.2020Symmetric Rendezvous-on-the-Line with Unkown Initial DistanceKhai Van Tran
03.03.2020Characterizing equatable graphs – node balancing by edge increments and decrementsNicolas Schneider
25.02.2020The complexity of cake cutting with unequal sharesÁgnes Cseh
13.02.2020Recognizing spaces in PolymakeDavide Lofano
28.01.2020On Equilibria in Atomic Splittable Flow Over Time GamesAntonia Adamik
17.12.2019Modeling and Optimization for the Snapshot Imaging PolarimeterZhen Liu
10.12.2019Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block LaplaciansPhilipp Warode
03.12.2019Second-Order Stochastic Dominance and Applications in SchedulingGuillaume Sagnol
19.11.2019 Design of Computer Experiments based on Bayesian QuadratureLuc Pronzato
19.11.2019Percolation and its convergence to Stochastic Loewner EvolutionAlexandra Quitmann
14.11.2019Degree-Bounded Polymatroids, with Applications to the Many-Visits TSPMatthias Mnich
05.11.2019Scheduling stochastic jobs with release dates on a single machineSven Jäger
29.10.2019The minimum cost query problem on matroids with uncertainty areasArturo Merino
22.10.2019Theoretical Aspects of Neural Networks for Solving Combinatorial Optimization ProblemsChristoph Hertrich
06.08.2019Orthogonal symmetric chain decompositionsSven Jäger
09.07.2019An Improved Upper Bound for the Ring Loading ProblemKarl Däubel
09.07.2019On the price of anarchy for flows over time with spillbackJonas Israel
02.07.2019Knapsack problem with quadratic constraintRico Raber
18.06.2019An unexpected connection between A-optimal designs and the Group LassoGuillaume Sagnol
28.05.2019The price of fixed assignments in stochastic extensible bin packingDaniel Schmidt genannt Waldschmidt
21.05.2019Approximating Total Weighted Completion Time on Identical Parallel Machines with Precedence Constraints and Release DatesSven Jäger
15.05.2019Nash flows over time with spillbackLeon Sering
07.05.2019Discrete Morse TheoryDavide Lofano
03.05.2019Monte Carlo approximation certificates for k-means clusteringSoledad Villar
23.04.2019Single-source unsplittable flowsSarah Morell
03.04.2019Deep LearningChristoph Hertrich
23.01.2019First order methods for convex optimizationGuillaume Sagnol
04.12.2018Matching extendability in hypercubesJiri Fink
20.11.2018 -
20.03.2019		Reading Group: Machine LearningCOGA
15.11.2018Scheduling a Proportionate Flow Shop of Batching MachinesChristoph Hertrich
24.10.2018Generalized flow, the net present value problem, and an open question in arithmetic computationNeil Olver
16.08.2018Symmetry Handling for Integer ProgramsMarc Pfetsch
26.07.2018Fullerenes and Graphene PatchesElizabeth Hartung
19.07.2018Gray Codes and Universal Cycles: Thinking Locally instead of GloballyAaron Williams
12.07.2018A (5/3 + ε)-Approximation for Unsplittable Flow on a Path: Placing Small Tasks into BoxesAndreas Wiese
28.06.2018Multiscale optimization of logistics networksFrieder Smolny
21.06.2018Design of Optimal Experiments with Model UncertaintyGuillaume Sagnol
14.06.2018Fußball ist MathematikMartin Skutella
31.05.2018Distance-Preserving Graph ContractionsKarl Däubel
24.05.2018Gray codes and symmetric chainsSven Jäger
09.05.2018Diversity maximization in doubling metricsSarah Morell
03.05.2018Scheduling a Proportionate Flowshop of Batching MachinesChristoph Hertrich
19.04.2018Summary of the item relocation problemPaul Fournel
15.02.2018On the Complexity of Instationary Gas FlowsMartin Skutella
08.02.2018Sparse Kneser graphs are HamiltonianTorsten Mütze
01.02.2018Algorithms for Massive GraphsAaron Bernstein
25.01.2018Stochastic Machine Scheduling, Gammoids and Time-Expanded NetworksRico Raber, Khai Van Tran
18.01.2018Online Bipartite Matching with Amortized O(log^2 N) ReplacementsAaron Bernstein
14.12.2017Incremental Cycle Detection and Topological Sort, Distance-preserving graph contractionsAaron Bernstein, Frieder Smolny
07.12.2017A Comparison-Based Approach to Spanners and ContractionsKarl Däubel
30.11.2017Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine schedulingSven Jäger
23.11.2017Earliest Arrival Transshipments in Networks With Multiple SinksMiriam Schlöter
16.11.2017The Price of Fixed Assignments in Stochastic Extensible Bin PackingGuillaume Sagnol
09.11.2017Nash Flows with time-varying capacitiesJulian Steger
09.11.2017Multi-Source Mult-Sink Nash Flows over TimeLeon Sering
19.10.2017Scheduling with Position-Dependent SpeedDaniel Schmidt genannt Waldschmidt
20.07.2017Graph Algorithms at ICALP 2017Frieder Smolny
04.07.2017Virtual Network Embedding Approximations: Leveraging Decomposable LP Formulations and Randomized RoundingMatthias Rost
28.06.2017An improved deterministic algorithm for dynamic single source shortest pathsAaron Bernstein
20.06.2017MST under Uncertainty in Theory and ExperimentsJulie Meißner
08.06.2017Scheduling Maintenance Jobs in NetworksJulie Meißner
30.05.2017Proximity results and faster algorithms for Integer Programming using the Steinitz LemmaRobert Weismantel
23.05.2017Stochastic Scheduling of Heavy-Tailed JobsSven Jäger
09.05.2017Stochastic Machine SchedulingRico Raber
07.03.2017Graph Contraction and Dynamic ProgrammingFrieder Smolny
28.02.2017Worst case bound of the LRF rule for minimizing total weighted completion time on identical parallel machinesSven Jäger
07.02.2017A Combinatorial Upper Bound on the Length of Twang CascadesLeon Sering
03.01.2017Graph Compression and Linear ProgrammingKarl Däubel
13.12.2016Trimming and gluing Gray codesTorsten Mütze
05.12.2016Tight Bounds for Online TSP on the LineJan Hackfeld
21.11.2016A 2.542-Approximation for Precedence Constrained Single Machine Scheduling with Release Dates and Total Weighted Completion Time ObjectiveMartin Skutella
17.05.2016Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack ProblemsFrank Neumann
03.05.2016Quickest Transshipments & Submodular Function MinimizationMiriam Schlöter
19.04.2016Truthful Outcomes from Non-Truthful Position AuctionsFelix Fischer
05.04.2016Iterative Algorithms for Integrated Optimization ProblemsSven Jäger
29.03.2016Recent developments in robust network flowsJannik Matuschke
08.03.2016Online scheduling models with machine costCsanad Imreh
26.01.2015Combinatorial Gray codes and the Chung-Feller theoremTorsten Mütze
08.12.2015Dealing with Big Data - An Introduction to Streaming AlgorithmsMartin Groß
24.11.2015On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner TreeAndreas Feldmann
16.11.2015The Online Matrix-Vector Multiplication ConjectureYann Disser
27.10.2015A Theory of Hardness for Polynomial TimeMartin Skutella
13.10.2015Hamilton cycles in (bipartite) Kneser graphsTorsten Mütze
19.06.2015Improved Online Algorithms for the Machine Covering Problem with Bounded MigrationWaldo Gálvez
05.06.2015Mechanism Design for Crowdsourcing: An Optimal 1–1/e Competitive Budget-Feasible Mechanism for Large MarketsMiriam Schlöter
05.05.2015Global EDF Scheduling of Systems of Conditional Sporadic DAG TasksAlberto Marchetti-Spaccamela
28.04.2015Lower bounds on the sizes of integer programs without additional variablesAlexander Richter
07.04.2015Towards Understanding the Smoothed Approximation Performance of the 2-OPT heuristicMarvin Künnemann
31.03.2015Polynomiality for Bin Packing with a Constant Number of Item Types (part II)Lin Chen
24.03.2015Polynomiality for Bin Packing with a Constant Number of Item Types (part I)Lin Chen
17.03.2015On the power of sampling in stochastic optimizationRoman Rischke
10.03.2015A strongly polynomial time algorithm for multicriteria global minimum cuts (part II)Sebastian Schenker
17.02.2015A strongly polynomial time algorithm for multicriteria global minimum cuts (part I)Sebastian Schenker
03.02.2015Undirected connectivity in log-spaceJan Hackfeld
27.01.2015Network improvement for equilibrium routingAntje Bjelde
20.01.2015The Burden of Risk Aversion in Selfish RoutingEvdokia Nikolova
13.01.2015Subgame-perfect equilibriaChristoph Hansknecht
09.12.2014Threesomes, Degenerates, and Love TrianglesJan-Philipp Kappmeier
02.12.2014An improved approximation algorithm for the stable marriage problem with one-sided tiesÁgnes Cseh
25.11.2014Faster Maximum-Flow Computation via Electrical FlowsKevin Schewior
18.11.2014Optimal Coordination Mechanisms for Multi-Job Scheduling GamesFidaa Abed (MPII)
11.11.2014Recent Improvements for the s-t path TSPJulie Meißner
04.11.2014The Complexity of the parity argument and other inefficient proofs of existenceMax Klimm
28.10.2014A strongly polynomial algorithm for generalized flow maximizationMartin Groß
21.10.2014A short introduction to extended formulationsJannik Matuschke
14.10.2014The Power of a Pebble: Exploring and Mapping Directed GraphsYann Disser
07.10.2014Integer multi-commodity flows and the cut conditionMartin Skutella