| Publication | Date of Publication | Type |
|---|
Multi-source multi-sink Nash flows over time
| 2024-08-27 | Paper |
Total completion time scheduling under scenarios
| 2024-07-19 | Paper |
A faster algorithm for quickest transshipments via an extended discrete Newton method
| 2024-07-19 | Paper |
Competitive strategies for symmetric rendezvous on the line
| 2024-07-19 | Paper |
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
INFORMS Journal on Computing | 2024-03-22 | Paper |
Reduction of Potential-Based Flow Networks
Mathematics of Operations Research | 2024-03-01 | Paper |
A note on the quickest minimum cost transshipment problem
Operations Research Letters | 2023-07-03 | Paper |
Towards Lower Bounds on the Depth of ReLU Neural Networks
SIAM Journal on Discrete Mathematics | 2023-06-22 | Paper |
On the robustness of potential-based flow networks
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Packing under convex quadratic constraints
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Single source unsplittable flows with arc-wise lower and upper bounds
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Packing under convex quadratic constraints
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Single source unsplittable flows with arc-wise lower and upper bounds
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs
Operations Research Letters | 2022-03-11 | Paper |
Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
| 2021-12-20 | Paper |
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
| 2021-04-13 | Paper |
Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
| 2020-08-05 | Paper |
Robust randomized matchings
Mathematics of Operations Research | 2020-03-12 | Paper |
Maximizing the storage capacity of gas networks: a global MINLP approach
Optimization and Engineering | 2019-10-29 | Paper |
Paths to stable allocations
International Journal of Game Theory | 2019-10-17 | Paper |
Optimal evacuation solutions for large-scale scenarios
Operations Research Proceedings | 2019-09-13 | Paper |
Algorithmic results for potential‐based flows: Easy and hard cases
Networks | 2019-07-30 | Paper |
On the complexity of instationary gas flows
Operations Research Letters | 2019-06-11 | Paper |
The simplex algorithm is NP-mighty
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Stable flows over time
Algorithms | 2019-03-26 | Paper |
Protection of flows under targeted attacks
Operations Research Letters | 2019-02-21 | Paper |
A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
Operations Research Letters | 2019-01-11 | Paper |
A tight bound on the speed-up through storage for quickest multi-commodity flows
Operations Research Letters | 2018-09-28 | Paper |
Fast and memory-efficient algorithms for evacuation problems
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Parallel repetition of MIP(2,1) systems
Lectures on Proof Verification and Approximation Algorithms | 2018-07-03 | Paper |
An incremental algorithm for the uncapacitated facility location problem
Networks | 2018-06-13 | Paper |
Graph orientation and flows over time
Networks | 2018-05-23 | Paper |
A note on the ring loading problem
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
The simplex algorithm is NP-mighty
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Robust randomized matchings
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
On the Complexity of Instationary Gas Flows
| 2017-08-29 | Paper |
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
SIAM Journal on Computing | 2017-07-21 | Paper |
On the size of weights in randomized search heuristics
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms | 2017-07-14 | Paper |
An introduction to network flows over time
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
Stochastic Scheduling on Unrelated Machines
| 2017-03-03 | Paper |
A PTAS for minimizing the weighted sum of job completion times on parallel machines
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
PolySCIP
Mathematical Software – ICMS 2016 | 2016-09-28 | Paper |
Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
Mathematics of Operations Research | 2016-08-10 | Paper |
Unrelated machine scheduling with stochastic processing times
Mathematics of Operations Research | 2016-08-10 | Paper |
The power of recourse for online MST and TSP
SIAM Journal on Computing | 2016-07-04 | Paper |
A note on the ring loading problem
SIAM Journal on Discrete Mathematics | 2016-03-04 | Paper |
Node-balancing by edge-increments
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Randomization helps computing a minimum spanning tree under uncertainty
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM | 2015-10-30 | Paper |
Earliest arrival flows in networks with multiple sinks
Discrete Applied Mathematics | 2015-09-22 | Paper |
Graph orientation and flows over time
Algorithms and Computation | 2015-09-11 | Paper |
scientific article; zbMATH DE number 6472626 (Why is no real title available?)
| 2015-08-14 | Paper |
Paths to Stable Allocations
Algorithmic Game Theory | 2015-01-14 | Paper |
Latency-constrained aggregation in sensor networks
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Length-bounded cuts and flows
ACM Transactions on Algorithms | 2014-09-09 | Paper |
The power of recourse for online MST and TSP
Automata, Languages, and Programming | 2013-08-12 | Paper |
Maximum multicommodity flows over time without intermediate storage
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Universal sequencing on an unreliable machine
SIAM Journal on Computing | 2012-09-12 | Paper |
Generalized Maximum Flows over Time
Approximation and Online Algorithms | 2012-07-16 | Paper |
The power of preemption on unrelated machines and applications to scheduling orders
Mathematics of Operations Research | 2012-05-24 | Paper |
Earliest arrival flows in networks with multiple sinks
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
A note on the generalized min-sum set cover problem
Operations Research Letters | 2012-04-05 | Paper |
Nash equilibria and the price of anarchy for flows over time
Theory of Computing Systems | 2011-11-23 | Paper |
Continuous and discrete flows over time
Mathematical Methods of Operations Research | 2011-08-16 | Paper |
Earliest Arrival Flows with Multiple Sources
Mathematics of Operations Research | 2011-04-27 | Paper |
Online scheduling with bounded migration
Mathematics of Operations Research | 2011-04-27 | Paper |
Computing minimum cuts by randomized search heuristics
Algorithmica | 2011-03-30 | Paper |
An FPTAS for flows over time with aggregate arc capacities
Approximation and Online Algorithms | 2011-02-15 | Paper |
On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Scheduling periodic tasks in a hard real-time environment
Automata, Languages and Programming | 2010-09-07 | Paper |
Solving an avionics real-time scheduling problem by advanced IP-methods
Algorithms – ESA 2010 | 2010-09-06 | Paper |
A Robust PTAS for Machine Covering and Packing
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Universal sequencing on a single machine
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
An FPTAS for quickest multicommodity flows with inflow-dependent transit times
Lecture Notes in Computer Science | 2010-05-26 | 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 |
Evolutionary algorithms and matroid optimization problems
Algorithmica | 2010-03-04 | Paper |
Flows with unit path capacities and related packing and covering problems
Journal of Combinatorial Optimization | 2009-12-02 | Paper |
Nash equilibria and the price of anarchy for flows over time
Algorithmic Game Theory | 2009-12-01 | Paper |
Real-Time Message Routing and Scheduling
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
The complexity of economic equilibria for house allocation markets
Information Processing Letters | 2009-07-09 | Paper |
Traffic Networks and Flows over Time
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
Single-source \(k\)-splittable min-cost flows
Operations Research Letters | 2009-05-07 | Paper |
Multiline addressing by network flow
Algorithmica | 2009-05-06 | Paper |
Length-Bounded Cuts and Flows
Automata, Languages and Programming | 2009-03-12 | Paper |
Flows with Unit Path Capacities and Related Packing and Covering Problems
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Convex Combinations of Single Source Unsplittable Flows
Algorithms – ESA 2007 | 2008-09-25 | Paper |
A short proof of the VPN tree routing conjecture on ring networks
Operations Research Letters | 2008-09-10 | Paper |
New Approaches for Virtual Private Network Design
SIAM Journal on Computing | 2008-06-19 | Paper |
Maximum \(k\)-splittable \(s, t\)-flows
Theory of Computing Systems | 2008-06-06 | Paper |
List Scheduling in Order of α-Points on a Single Machine
Lecture Notes in Computer Science | 2008-03-14 | Paper |
Multiline Addressing by Network Flow
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Latency Constrained Aggregation in Sensor Networks
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Quickest Flows Over Time
SIAM Journal on Computing | 2008-01-03 | Paper |
Multicommodity flows over time: Efficient algorithms and complexity
Theoretical Computer Science | 2007-07-16 | Paper |
An FPTAS for quickest multicommodity flows with inflow-dependent transit times
Algorithmica | 2007-04-26 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
The freeze-tag problem: How to wake up a swarm of robots
Algorithmica | 2006-11-06 | Paper |
Flows on few paths: Algorithms and lower bounds
Networks | 2006-09-12 | Paper |
The \(k\)-splittable flow problem
Algorithmica | 2006-03-21 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
scientific article; zbMATH DE number 2223065 (Why is no real title available?)
| 2005-11-04 | Paper |
Stochastic Machine Scheduling with Precedence Constraints
SIAM Journal on Computing | 2005-09-16 | Paper |
Flows over Time with Load-Dependent Transit Times
SIAM Journal on Optimization | 2005-09-16 | Paper |
Approximating \(k\)-hop minimum-spanning trees
Operations Research Letters | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Scheduling with AND/OR Precedence Constraints
SIAM Journal on Computing | 2005-02-21 | Paper |
The freeze-tag problem: how to wake up a swarm of robots
| 2004-11-29 | Paper |
scientific article; zbMATH DE number 2119659 (Why is no real title available?)
| 2004-11-29 | Paper |
Cooperative facility location games
Journal of Algorithms | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2086912 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2079322 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 2038726 (Why is no real title available?)
| 2004-02-08 | Paper |
Preemptive scheduling with rejection
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
The power of \(\alpha\)-points in preemptive single machine scheduling.
Journal of Scheduling | 2003-07-27 | Paper |
scientific article; zbMATH DE number 1947385 (Why is no real title available?)
| 2003-07-08 | Paper |
scientific article; zbMATH DE number 1947425 (Why is no real title available?)
| 2003-07-08 | Paper |
Scheduling Unrelated Machines by Randomized Rounding
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
Approximating the single source unsplittable min-cost flow problem
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
scientific article; zbMATH DE number 1741110 (Why is no real title available?)
| 2002-05-15 | Paper |
Single machine scheduling with release dates
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
| 2002-03-24 | Paper |
Approximation algorithms for the discrete time-cost tradeoff problem
Mathematics of Operations Research | 2001-11-26 | Paper |
A PTAS for minimizing the total weighted completion time on identical parallel machines.
Mathematics of Operations Research | 2001-11-26 | Paper |
scientific article; zbMATH DE number 1670665 (Why is no real title available?)
| 2001-11-11 | Paper |
Approximation and randomization in scheduling
| 2001-07-05 | Paper |
scientific article; zbMATH DE number 1405788 (Why is no real title available?)
| 2000-10-25 | Paper |
scientific article; zbMATH DE number 1445309 (Why is no real title available?)
| 2000-05-10 | Paper |
scientific article; zbMATH DE number 1445290 (Why is no real title available?)
| 2000-05-10 | Paper |
