| Publication | Date of Publication | Type |
|---|
A simplified analysis of the ascending auction to sell a matroid base
Operations Research Letters | 2026-03-09 | Paper |
A flow-based ascending auction to compute buyer-optimal Walrasian prices
Networks | 2024-09-05 | Paper |
| Oligopolistic competitive packet routing | 2024-08-27 | Paper |
| Stackelberg Vertex Cover on a Path | 2023-07-13 | Paper |
Stackelberg Max Closure with Multiple Followers
Mathematics of Operations Research | 2023-01-09 | Paper |
Matroid bases with cardinality constraints on the intersection
Mathematical Programming. Series A. Series B | 2022-06-29 | Paper |
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
SIAM Journal on Discrete Mathematics | 2021-11-04 | Paper |
In memoriam Walter Kern
Discrete Applied Mathematics | 2021-09-15 | Paper |
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
(available as arXiv preprint) | 2020-04-16 | Paper |
Additive stabilizers for unstable graphs
Discrete Optimization | 2019-06-13 | Paper |
Protection of flows under targeted attacks
Operations Research Letters | 2019-02-21 | Paper |
Optimization problems with color-induced budget constraints
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Congestion games viewed from M-convexity
Operations Research Letters | 2018-09-28 | Paper |
Robust flows over time: models and complexity results
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
Sensitivity analysis for convex separable optimization over integral polymatroids
SIAM Journal on Optimization | 2018-08-21 | Paper |
Greedy oriented flows
Algorithmica | 2018-05-23 | Paper |
| Competitive packet routing with priority lists | 2018-03-21 | Paper |
Primal-dual algorithms for precedence constrained covering problems
Algorithmica | 2017-10-09 | Paper |
Matroids are immune to Braess' paradox
Mathematics of Operations Research | 2017-09-22 | Paper |
Matroids are immune to Braess' paradox
Mathematics of Operations Research | 2017-09-22 | Paper |
Optimization problems with color-induced budget constraints
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Submodular function maximization on the bounded integer lattice
Approximation and Online Algorithms | 2016-02-26 | Paper |
Finding small stabilizers for unstable graphs
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Primal-dual algorithms for precedence constrained covering problems
Approximation and Online Algorithms | 2015-11-20 | Paper |
Resource buying games
Algorithmica | 2015-01-19 | Paper |
Resource competition on integral polymatroids
Web and Internet Economics | 2015-01-07 | Paper |
Two-phase greedy algorithms for some classes of combinatorial linear programs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Structure analysis of some generalizations of matchings and matroids under algorithmic aspects | 2014-09-28 | Paper |
Abstract flows over time: a first step towards solving dynamic packing problems
Theoretical Computer Science | 2014-07-07 | Paper |
Finding small stabilizers for unstable graphs
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
On generalizations of network design problems with degree bounds
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Abstract flows over time: a first step towards solving dynamic packing problems
Algorithms and Computation | 2013-03-21 | Paper |
Lattice polyhedra and submodular flows
Japan Journal of Industrial and Applied Mathematics | 2012-12-28 | Paper |
Resource buying games
Algorithms – ESA 2012 | 2012-09-25 | Paper |
A ranking model for the greedy algorithm and discrete convexity
Mathematical Programming. Series A. Series B | 2012-04-27 | Paper |
A primal-dual algorithm for weighted abstract cut packing
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Universal packet routing with arbitrary bandwidths and transit times
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
On greedy and submodular matrices
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
On greedy and submodular matrices
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Throughput maximization for periodic packet routing on trees and grids
Approximation and Online Algorithms | 2011-02-15 | Paper |
Policies for periodic packet routing
Algorithms and Computation | 2010-12-09 | Paper |
Lattices and maximum flow algorithms in planar graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
| scientific article; zbMATH DE number 5764848 (Why is no real title available?) | 2010-08-06 | Paper |
On generalizations of network design problems with degree bounds
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Packet Routing: Complexity and Algorithms
Approximation and Online Algorithms | 2010-05-11 | Paper |
Packet Routing on the Grid
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Real-Time Message Routing and Scheduling
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
On a relation between the domination number and a strongly connected bidirection of an undirected graph
Discrete Applied Mathematics | 2009-03-04 | Paper |
Note on pseudolattices, lattices and submodular linear programs
Discrete Optimization | 2008-10-29 | Paper |
A Hierarchical Model for Cooperative Games
Algorithmic Game Theory | 2008-05-02 | Paper |
Note on maximal split-stable subgraphs
Discrete Applied Mathematics | 2007-09-19 | Paper |
Two disjoint negative cycles in a signed graph
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
