2024
A flow-based ascending auction to compute buyer-optimal Walrasian prices.
Networks, 2024
A Simplified Analysis of the Ascending Auction to Sell a Matroid Base.
CoRR, 2024
2023
Faster Ascending Auctions via Polymatroid Sum.
CoRR, 2023
Recoverable Robust Optimization with Commitment.
CoRR, 2023
Stackelberg Vertex Cover on a Path.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023
2022
Stackelberg Max Closure with Multiple Followers.
Math. Oper. Res., November, 2022
Matroid bases with cardinality constraints on the intersection.
Math. Program., 2022
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 22192).
Dagstuhl Reports, 2022
2021
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices.
SIAM J. Discret. Math., 2021
Discret. Appl. Math., 2021
2020
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017).
Discret. Appl. Math., 2020
2019
Additive stabilizers for unstable graphs.
Discret. Optim., 2019
2018
Competitive Packet Routing with Priority Lists.
ACM Trans. Economics and Comput., 2018
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids.
SIAM J. Optim., 2018
Robust flows over time: models and complexity results.
Math. Program., 2018
Optimization problems with color-induced budget constraints.
J. Comb. Optim., 2018
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102).
Dagstuhl Reports, 2018
Oligopolistic Competitive Packet Routing.
Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018
2017
Protection of flows under targeted attacks.
Oper. Res. Lett., 2017
Matroids Are Immune to Braess' Paradox.
Math. Oper. Res., 2017
The Primal-Dual Greedy Algorithm for Weighted Covering Problems.
CoRR, 2017
Computational Methods for Path-based Robust Flows.
CoRR, 2017
Primal-Dual Algorithms for Precedence Constrained Covering Problems.
Algorithmica, 2017
2016
Competitive Packet Routing with Priority Lists.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
2015
Congestion games viewed from M-convexity.
Oper. Res. Lett., 2015
Finding small stabilizers for unstable graphs.
Math. Program., 2015
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412).
Dagstuhl Reports, 2015
Submodular Function Maximization on the Bounded Integer Lattice.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015
2014
Abstract flows over time: A first step towards solving dynamic packing problems.
Theor. Comput. Sci., 2014
Resource Competition on Integral Polymatroids.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014
Primal-Dual Algorithms for Precedence Constrained Covering Problems.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014
2013
On generalizations of network design problems with degree bounds.
Math. Program., 2013
2012
A ranking model for the greedy algorithm and discrete convexity.
Math. Program., 2012
Max-Flow on Regular Spaces
CoRR, 2012
Abstract Flows over Time.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012
Flows over Time with Negative Transit Times and Arc Release Dates.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012
2011
On Greedy and Submodular Matrices.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011
Universal Packet Routing with Arbitrary Bandwidths and Transit Times.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
A Primal-Dual Algorithm for Weighted Abstract Cut Packing.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
2010
Two-phase greedy algorithms for some classes of combinatorial linear programs.
ACM Trans. Algorithms, 2010
Lattices and Maximum Flow Algorithms in Planar Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010
Throughput Maximization for Periodic Packet Routing on Trees and Grids.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010
Packet Routing on the Grid.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
Policies for Periodic Packet Routing.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
Lattice Polyhedra and Submodular Flows.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
2009
Packet Routing: Complexity and Algorithms.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009
Real-Time Message Routing and Scheduling.
Proceedings of the Approximation, 2009
2008
Note on pseudolattices, lattices and submodular linear programs.
Discret. Optim., 2008
On a relation between the domination number and a strongly connected bidirection of an undirected graph.
Discret. Appl. Math., 2008
A Hierarchical Model for Cooperative Games.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008
2007
Note on maximal split-stable subgraphs.
Discret. Appl. Math., 2007
A two-phase greedy algorithm for modular lattice polyhedra.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007
2006
Two disjoint negative cycles in a signed graph.
Electron. Notes Discret. Math., 2006
Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006