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:15Date | Title | Speaker |
---|---|---|
16.07.2025 | Algorithmic Results for Bounded-Density Edge Deletion via Generalized Flows and Matchings | Tom-Lukas Breitkopf (AKT) |
09.07.2025 | Online Makespan Scheduling under Scenarios | Ekin Ergen (COGA) |
18.06.2025 | A Little Clairvoyance Is All You Need: Scheduling with Progress Bars | Alexander Lindermayr (Universität Bremen) |
28.05.2025 | The Power of Proportional Fairness for Non-clairvoyant Polytope Scheduling | Sven Jäger |
21.05.2025 | Generalized Assignment and Knapsack Problems in the Random-Order Model | Martin Knaack (DISCO) |
14.05.2025 | Parameterized Complexity of Segment Routing | André Nichterlein (AKT) |
30.04.2025 | On Integer Multiflows and Cut Conditions | Martin Skutella (COGA) |
23.04.2025 | New Combinatorial Insights for Monotone Apportionment | Javier Cembrano (MPI-INF) |
09.04.2025 | A Tight O(3/2+ε)-Approximation Algorithm for Demand Strip Packing | Franziska Eberle (COGA&DISCO) |
02.04.2025 | Decomposition Polyhedra of Piecewise Linear Functions | Moritz Grillo (COGA) |
12.03.2025 | Unsplittable transshipments | Srinwanti Debgupta (COGA) |
26.02.2025 | Matching Augmentation in Demand-Aware Networks | Arash Pourdamghani (TU Berlin) |
11.12.2024 | Valid Cuts for the Design of Potential-based Flow Networks | Lea Strubberg (DISCO) |
11.12.2024 | Introduction to (Node-)Scanwidth | Sebastian Bruchhold (COGA&DISCO) |
27.11.2024 | Packing a Knapsack with Items Owned by Strategic Agents | Martin Knaack (DISCO) |
13.11.2024 | Generalized worst-case instances for the simplex algorithm using games on graphs | Matthew Maat (UT-EEMCS) |
18.07.2024 | Approximation of binary second-order cone programs of packing type | Max Klimm (DISCO) |
11.07.2024 | Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds | Arturo Merino (Universidad de O’Higgins) |
04.07.2024 | Fixed Order Routing and other souvenirs from Kolding | Ekin Ergen (COGA) |
27.06.2024 | A First Order Method for Linear Programming Parameterized by Circuit Imbalance | Christoph Hertrich |
13.05.2024 | Complexity of Deciding Injectivity and Surjectivity of ReLU Neural Networks | Moritz Grillo (COGA) |
06.05.2024 | Destroying Densest Subgraphs is Hard | André Nichterlein (AKT) |
29.04.2024 | Recovering potential-based flow networks during operations and under uncertainty | Lea Strubberg (DISCO) |
19.03.2024 | O(1/ε) Is the Answer in Online Weighted Throughput Maximization | Franziska Eberle (COGA&DISCO) |
05.03.2024 | I.I.D. Prophet Inequalities from Samples | Felix Fischer (Queen Mary University of London) |
27.02.2024 | Impartial rank aggregation | Javier Cembrano (DISCO) |
20.02.2024 | Disbalance of Machines in Total Completion Time Scheduling Under Scenarios | Ekin Ergen (COGA) |
23.01.2024 | The Secretary Problem with Independent Sampling | Tim Oosterwijk (VU Amsterdam) |
19.12.2023 | Decomposing Probability Marginals Beyond Affine Requirements | Jannik Matuschke (KU Leuven) |
12.12.2023 | Searching for infections in (Un)certain Graphs | José Verschae (Pontificia Universidad Católica de Chile) |
28.11.2023 | Deterministic Impartial Selection with Weights | Svenja Griesbach (DISCO) |
14.11.2023 | Determinantal sieving | Tomohiro Koana (AKT) |
07.11.2023 | Properties of equilibria in dynamic agent-based traffic models | Theresa Ziemke (COGA) |
31.10.2023 | A Brief Journey Through Proportionality | Jannik Peters (TU Berlin) |
17.10.2023 | On Pairwise Graph Connectivity | Tobias Hofmann (COGA&DISCO) |
18.07.2023 | Symmetric RDV on the line: Markov Strategy with Lookahead and Randomized Offset | Florian Oubaha (Internship) |
04.07.2023 | Complexity of equilibria in binary public goods games on undirected graphs | Maximilian Stahlberg (DISCO) |
27.06.2023 | Price of Stability of the Shapley Network Formation Game | Alice Pain (Internship) |
20.06.2023 | Transshipments Over Time and Submodular Functions | Martin Skutella (COGA) |
13.06.2023 | Information Design for Congestion Games with Unknown Demand | Svenja Griesbach (DISCO) |
06.06.2023 | Improved Bounds for Single-Nomination Impartial Selection | Javier Cembrano (DISCO) |
30.05.2023 | Spatiotemporal reconstruction of ancient road networks | Maximilian Stahlberg (DISCO) |
23.05.2023 | News from the Workshop on Multi-Agent Systems | Max Klimm (DISCO) |
16.05.2023 | Total completion time scheduling under scenarios | Ekin Ergen (COGA) |
02.05.2023 | Coupling Models for Cardiac Electrophysiology with transparent interface conditions | Lea Strubberg (DISCO) |
21.02.2023 | Topological Expressive Power of ReLU Neural Networks | Moritz Grillo (COGA) |
14.02.2023 | Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling | Philipp Warode (HU Berin) and Guillaume Sagnol (COGA) |
07.02.2023 | The Polyhedral Geometry of Truthful Auctions | Sylvain Spitz (DISCO) |
17.01.2023 | Souvenirs from Aussois | Ekin Ergen (COGA) |
13.12.2022 | Training Fully Connected Neural Networks is ∃R-Complete | Christoph Hertrich (LSE) |
06.12.2022 | Incremental Optimization of Potential Based Flows | Annette Lutz (TU Darmstadt) |
22.11.2022 | Improved Approximation Algorithms for the Expanding Search Problem | Svenja Griesbach (DISCO) |
15.11.2022 | A Note on the Quickest Minimum Cost Transshipment Problem | Martin Skutella (COGA) |
08.11.2022 | How bad is Farthest Insertion? | Ekin Ergen (COGA) |
01.11.2022 | Dynamic Programming and Semi-Coalgebras | Moritz Grillo (COGA) |
25.10.2022 | Optimal Impartial Correspondences | Javier Cembrano (DISCO) |
18.10.2022 | Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint | Martin Knaack (DISCO) |
12.07.2022 | Single Source Unsplittable Flows and their Application in Machine Scheduling | Sarah Morell (COGA) |
12.07.2022 | On Minimizing the Weighted Number of Late Jobs | Dimas Arsaputra |
05.07.2022 | Public Signals in Network Congestion Games | Svenja Griesbach (DISCO) |
28.06.2022 | Generalized Perron Roots and Solvability of the Absolute Value Equation | Manuel Radons (TU Berlin) |
14.06.2022 | Impartial Selection with Additive Guarantees via Iterated Deletion | Javier Cembrano (DISCO) |
07.06.2022 | Gomory-Hu Trees on Special Classes of Parametric Graphs | Margarete Wohlleber |
31.05.2022 | Equilibria in Multiclass and Multidimensional Atomic Congestion Games | Max Klimm (DISCO) |
17.05.2022 | From Combinatorial Optimization to Gray codes | Arturo Merino (COGA) |
10.05.2022 | Lower Bounds for Approximation Algorithms for the Steiner Tree Problem | Ekin Ergen (COGA) |
26.04.2022 | Parametric Min Cut Complexity | Tom McCormick |
19.04.2022 | Connectivity thresholds in random temporal graphs | Malte Renken (TU Berin) |
09.03.2022 | A time-expanded Knapsack Problem with quadratic constraints | Chiara Fusar Bassini |
15.12.2021 | Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment | Tobias Harks (Uni Augsburg) |
15.12.2021 | Training Neural Networks is even harder | Linda Kleist (TU Braunschweig) |
08.12.2021 | Convergence of a Packet Routing Model to Flows Over Time | Laura Vargas Koch (ETH Zürich) |
01.12.2021 | Optimisation with Squared Lasso Penalty | Valentin Kirchner (TU Berlin) |
24.11.2021 | Efficient generation of elimination trees and Hamilton paths on graph associahedra | Arturo Merino (COGA) |
17.11.2021 | Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages | Svenja Griesbach (DISCO) |
10.11.2021 | Fractionally Subadditive Maximization under an Incremental Knapsack Constraint | David Weckbecker (TU Darmstadt) |
10.11.2021 | Stochastic Probing with Increasing Precision | Kevin Schewior (Uni Köln) |
27.10.2021 | Evaluating the Potential of Reinforcement Learning for Stochastic Machine Scheduling Problems | Mohammed Majthoub Almoghrabi (COGA) |
20.10.2021 | Multidimensional Apportionment through Discrepancy Theory | Javier Cembrano (DISCO) |
13.10.2021 | Additive approximation schemes for load balancing problems | Moritz Buchem (Maastricht University) |
21.09.2021 | An Algorithm-Independent Measure of Progress for Linear Constraint Propagation | Boro Sofranac (IOL) |
14.09.2021 | Combinatorial Diameter of Random Polyhedra | Sophie Huiberts |
17.08.2021 | A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method | Khai Van Tran (COGA) |
20.07.2021 | Computational experiments and multiscale optimization | Frieder Smolny (COGA) |
06.07.2021 | Restricted Adaptivity in Stochastic Scheduling | Daniel Schmidt genannt Waldschmidt (COGA) |
22.06.2021 | Evolution of Boosting | Max-Georg Schorr (IOL) |
15.06.2021 | Nash flows over time in MATSim? | Theresa Ziemke (COGA) |
08.06.2021 | Greedy strategies for exhaustive generation | Arturo Merino (COGA) |
25.05.2021 | Borsuk’s problem | Paco Criado (IOL) |
11.05.2021 | Tackling Neural Network Expressivity via (virtual Newton) polytopes | Christoph Hertrich (COGA) |
25.03.2021 | A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs | Martin Skutella (COGA) |
18.03.2021 | Static and dynamic pricing of identical items | Max Klimm (DISCO) |
18.03.2021 | Robust conic optimization in Python | Maximilian Stahlberg (DISCO) |
11.03.2021 | Set Curvature in Machine Learning | Thomas Kerdreux (IOL) |
11.03.2021 | Differential Privacy for Machine Learning | Valentin Hartmann (EPFL) |
04.03.2021 | Scheduling under Contact Restrictions - A Problem Arising in Pandemics | Daniel Schmidt genannt Waldschmidt (COGA) |
18.02.2021 | Greedy Batch-Scheduling | Guillaume Sagnol (COGA) |
04.02.2021 | Differentiable Optimization & Integration within Differentiable Programming | Mathieu Besançon (IOL) |
28.01.2021 | Online Scheduling of Deterministic and Stochastic Jobs on Unrelated Machines | Sven Jäger (COGA) |
21.01.2021 | Parametric Computation of Minimum Cost Flows | Philipp Warode (DISCO) |
14.01.2021 | Robust Optimization and Learning | Kartikey Sharma (IOL) |
14.01.2021 | Neural Network Approximation Theory | Shpresim Sadiku (IOL) |
07.01.2021 | Contractibility vs Collapsibility | Davide Lofano (COGA) |
17.12.2020 | Efficient generation of rectangulations via permutation languages | Arturo Merino (COGA) |
10.12.2020 | Accelerating Domain Propagation: an Efficient GPU-Parallel Algorithm over Sparse Matrices | Boro Sofranac (IOL) |
03.12.2020 | Local Acceleration of Conditional Gradients | Alejandro Carderera (IOL, Georgia Tech) |
26.11.2020 | Multidimensional Packing under Convex Quadratic Constraints | Rico Raber (COGA) |
19.11.2020 | Learning Relations From Data With Conditional Gradients | Elias Wirth (IOL) |
17.11.2020 | Understanding Neural Network Decisions is Hard - From Probabilistic Prime Implicants to Arc Bending | Stephan Wäldchen (TU Berlin) |
12.11.2020 | The artification of the so-called A.I. art and the creative industry | Thomas Kerdreux (IOL) |
12.11.2020 | Improved Bounds on the Competitive Ratio for Symmetric Rendezvous-on-the-Line with Unknown Initial Distance | Khai Van Tran (COGA) |
05.11.2020 | Computing the Maximum Function with ReLU Neural Networks | Christoph Hertrich (COGA) |
27.10.2020 | Frank-Wolfe with New and Practical Descent Directions | Cyrille Combettes (IOL, Georgia Tech) |
09.10.2020 | Komplexität und Berechenbarkeit von robusten Schnitten in Graphen | Sebastian Ortmanns |
25.06.2020 | On the two-dimensional knapsack problem for convex polygons | Arturo Merino |
12.06.2020 | Screening rules for Lasso and Optimal Designs | Guillaume Sagnol |
05.06.2020 | Non-Clairvoyant Precedence Constrained Scheduling | Sven Jäger |
26.05.2020 | Minimum-cost integer circulations in given homology classes | Sarah Morell |
19.05.2020 | The Santa Claus Problem | Daniel Schmidt genannt Waldschmidt |
05.05.2020 | Multi-commodity Nash flows | Leon Sering |
28.04.2020 | The Maximum Leaf Spanning Tree Problem on Grid Graphs | Karl Däubel |
21.04.2020 | Derandomizing Unconstrained Submodular Function Maximization | Khai Van Tran |
14.04.2020 | Representation Benefits of Deep Feedforward Networks | Christoph Hertrich |
07.04.2020 | On the Robustness of Potential-Based Flow Networks | Rico Raber |
31.03.2020 | Some Aspects of Graph Sparsification in Theory and Practice | Karl Däubel |
03.03.2020 | Symmetric Rendezvous-on-the-Line with Unkown Initial Distance | Khai Van Tran |
03.03.2020 | Characterizing equatable graphs – node balancing by edge increments and decrements | Nicolas Schneider |
25.02.2020 | The complexity of cake cutting with unequal shares | Ágnes Cseh |
13.02.2020 | Recognizing spaces in Polymake | Davide Lofano |
28.01.2020 | On Equilibria in Atomic Splittable Flow Over Time Games | Antonia Adamik |
17.12.2019 | Modeling and Optimization for the Snapshot Imaging Polarimeter | Zhen Liu |
10.12.2019 | Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians | Philipp Warode |
03.12.2019 | Second-Order Stochastic Dominance and Applications in Scheduling | Guillaume Sagnol |
19.11.2019 | Design of Computer Experiments based on Bayesian Quadrature | Luc Pronzato |
19.11.2019 | Percolation and its convergence to Stochastic Loewner Evolution | Alexandra Quitmann |
14.11.2019 | Degree-Bounded Polymatroids, with Applications to the Many-Visits TSP | Matthias Mnich |
05.11.2019 | Scheduling stochastic jobs with release dates on a single machine | Sven Jäger |
29.10.2019 | The minimum cost query problem on matroids with uncertainty areas | Arturo Merino |
22.10.2019 | Theoretical Aspects of Neural Networks for Solving Combinatorial Optimization Problems | Christoph Hertrich |
06.08.2019 | Orthogonal symmetric chain decompositions | Sven Jäger |
09.07.2019 | An Improved Upper Bound for the Ring Loading Problem | Karl Däubel |
09.07.2019 | On the price of anarchy for flows over time with spillback | Jonas Israel |
02.07.2019 | Knapsack problem with quadratic constraint | Rico Raber |
18.06.2019 | An unexpected connection between A-optimal designs and the Group Lasso | Guillaume Sagnol |
28.05.2019 | The price of fixed assignments in stochastic extensible bin packing | Daniel Schmidt genannt Waldschmidt |
21.05.2019 | Approximating Total Weighted Completion Time on Identical Parallel Machines with Precedence Constraints and Release Dates | Sven Jäger |
15.05.2019 | Nash flows over time with spillback | Leon Sering |
07.05.2019 | Discrete Morse Theory | Davide Lofano |
03.05.2019 | Monte Carlo approximation certificates for k-means clustering | Soledad Villar |
23.04.2019 | Single-source unsplittable flows | Sarah Morell |
03.04.2019 | Deep Learning | Christoph Hertrich |
23.01.2019 | First order methods for convex optimization | Guillaume Sagnol |
04.12.2018 | Matching extendability in hypercubes | Jiri Fink |
20.11.2018 - 20.03.2019 | Reading Group: Machine Learning | COGA |
15.11.2018 | Scheduling a Proportionate Flow Shop of Batching Machines | Christoph Hertrich |
24.10.2018 | Generalized flow, the net present value problem, and an open question in arithmetic computation | Neil Olver |
16.08.2018 | Symmetry Handling for Integer Programs | Marc Pfetsch |
26.07.2018 | Fullerenes and Graphene Patches | Elizabeth Hartung |
19.07.2018 | Gray Codes and Universal Cycles: Thinking Locally instead of Globally | Aaron Williams |
12.07.2018 | A (5/3 + ε)-Approximation for Unsplittable Flow on a Path: Placing Small Tasks into Boxes | Andreas Wiese |
28.06.2018 | Multiscale optimization of logistics networks | Frieder Smolny |
21.06.2018 | Design of Optimal Experiments with Model Uncertainty | Guillaume Sagnol |
14.06.2018 | Fußball ist Mathematik | Martin Skutella |
31.05.2018 | Distance-Preserving Graph Contractions | Karl Däubel |
24.05.2018 | Gray codes and symmetric chains | Sven Jäger |
09.05.2018 | Diversity maximization in doubling metrics | Sarah Morell |
03.05.2018 | Scheduling a Proportionate Flowshop of Batching Machines | Christoph Hertrich |
19.04.2018 | Summary of the item relocation problem | Paul Fournel |
15.02.2018 | On the Complexity of Instationary Gas Flows | Martin Skutella |
08.02.2018 | Sparse Kneser graphs are Hamiltonian | Torsten Mütze |
01.02.2018 | Algorithms for Massive Graphs | Aaron Bernstein |
25.01.2018 | Stochastic Machine Scheduling, Gammoids and Time-Expanded Networks | Rico Raber, Khai Van Tran |
18.01.2018 | Online Bipartite Matching with Amortized O(log^2 N) Replacements | Aaron Bernstein |
14.12.2017 | Incremental Cycle Detection and Topological Sort, Distance-preserving graph contractions | Aaron Bernstein, Frieder Smolny |
07.12.2017 | A Comparison-Based Approach to Spanners and Contractions | Karl Däubel |
30.11.2017 | Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling | Sven Jäger |
23.11.2017 | Earliest Arrival Transshipments in Networks With Multiple Sinks | Miriam Schlöter |
16.11.2017 | The Price of Fixed Assignments in Stochastic Extensible Bin Packing | Guillaume Sagnol |
09.11.2017 | Nash Flows with time-varying capacities | Julian Steger |
09.11.2017 | Multi-Source Mult-Sink Nash Flows over Time | Leon Sering |
19.10.2017 | Scheduling with Position-Dependent Speed | Daniel Schmidt genannt Waldschmidt |
20.07.2017 | Graph Algorithms at ICALP 2017 | Frieder Smolny |
04.07.2017 | Virtual Network Embedding Approximations: Leveraging Decomposable LP Formulations and Randomized Rounding | Matthias Rost |
28.06.2017 | An improved deterministic algorithm for dynamic single source shortest paths | Aaron Bernstein |
20.06.2017 | MST under Uncertainty in Theory and Experiments | Julie Meißner |
08.06.2017 | Scheduling Maintenance Jobs in Networks | Julie Meißner |
30.05.2017 | Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma | Robert Weismantel |
23.05.2017 | Stochastic Scheduling of Heavy-Tailed Jobs | Sven Jäger |
09.05.2017 | Stochastic Machine Scheduling | Rico Raber |
07.03.2017 | Graph Contraction and Dynamic Programming | Frieder Smolny |
28.02.2017 | Worst case bound of the LRF rule for minimizing total weighted completion time on identical parallel machines | Sven Jäger |
07.02.2017 | A Combinatorial Upper Bound on the Length of Twang Cascades | Leon Sering |
03.01.2017 | Graph Compression and Linear Programming | Karl Däubel |
13.12.2016 | Trimming and gluing Gray codes | Torsten Mütze |
05.12.2016 | Tight Bounds for Online TSP on the Line | Jan Hackfeld |
21.11.2016 | A 2.542-Approximation for Precedence Constrained Single Machine Scheduling with Release Dates and Total Weighted Completion Time Objective | Martin Skutella |
17.05.2016 | Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems | Frank Neumann |
03.05.2016 | Quickest Transshipments & Submodular Function Minimization | Miriam Schlöter |
19.04.2016 | Truthful Outcomes from Non-Truthful Position Auctions | Felix Fischer |
05.04.2016 | Iterative Algorithms for Integrated Optimization Problems | Sven Jäger |
29.03.2016 | Recent developments in robust network flows | Jannik Matuschke |
08.03.2016 | Online scheduling models with machine cost | Csanad Imreh |
26.01.2015 | Combinatorial Gray codes and the Chung-Feller theorem | Torsten Mütze |
08.12.2015 | Dealing with Big Data - An Introduction to Streaming Algorithms | Martin Groß |
24.11.2015 | On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree | Andreas Feldmann |
16.11.2015 | The Online Matrix-Vector Multiplication Conjecture | Yann Disser |
27.10.2015 | A Theory of Hardness for Polynomial Time | Martin Skutella |
13.10.2015 | Hamilton cycles in (bipartite) Kneser graphs | Torsten Mütze |
19.06.2015 | Improved Online Algorithms for the Machine Covering Problem with Bounded Migration | Waldo Gálvez |
05.06.2015 | Mechanism Design for Crowdsourcing: An Optimal 1–1/e Competitive Budget-Feasible Mechanism for Large Markets | Miriam Schlöter |
05.05.2015 | Global EDF Scheduling of Systems of Conditional Sporadic DAG Tasks | Alberto Marchetti-Spaccamela |
28.04.2015 | Lower bounds on the sizes of integer programs without additional variables | Alexander Richter |
07.04.2015 | Towards Understanding the Smoothed Approximation Performance of the 2-OPT heuristic | Marvin Künnemann |
31.03.2015 | Polynomiality for Bin Packing with a Constant Number of Item Types (part II) | Lin Chen |
24.03.2015 | Polynomiality for Bin Packing with a Constant Number of Item Types (part I) | Lin Chen |
17.03.2015 | On the power of sampling in stochastic optimization | Roman Rischke |
10.03.2015 | A strongly polynomial time algorithm for multicriteria global minimum cuts (part II) | Sebastian Schenker |
17.02.2015 | A strongly polynomial time algorithm for multicriteria global minimum cuts (part I) | Sebastian Schenker |
03.02.2015 | Undirected connectivity in log-space | Jan Hackfeld |
27.01.2015 | Network improvement for equilibrium routing | Antje Bjelde |
20.01.2015 | The Burden of Risk Aversion in Selfish Routing | Evdokia Nikolova |
13.01.2015 | Subgame-perfect equilibria | Christoph Hansknecht |
09.12.2014 | Threesomes, Degenerates, and Love Triangles | Jan-Philipp Kappmeier |
02.12.2014 | An improved approximation algorithm for the stable marriage problem with one-sided ties | Ágnes Cseh |
25.11.2014 | Faster Maximum-Flow Computation via Electrical Flows | Kevin Schewior |
18.11.2014 | Optimal Coordination Mechanisms for Multi-Job Scheduling Games | Fidaa Abed (MPII) |
11.11.2014 | Recent Improvements for the s-t path TSP | Julie Meißner |
04.11.2014 | The Complexity of the parity argument and other inefficient proofs of existence | Max Klimm |
28.10.2014 | A strongly polynomial algorithm for generalized flow maximization | Martin Groß |
21.10.2014 | A short introduction to extended formulations | Jannik Matuschke |
14.10.2014 | The Power of a Pebble: Exploring and Mapping Directed Graphs | Yann Disser |
07.10.2014 | Integer multi-commodity flows and the cut condition | Martin Skutella |