| Publication | Date of Publication | Type |
|---|
Approximation algorithms for maximum weighted throughput on unrelated machines
Theoretical Computer Science | 2025-05-12 | Paper |
| Approximation algorithms for maximum weighted throughput on unrelated machines | 2025-01-14 | Paper |
Time-sharing scheduling with tolerance capacities
Journal of Computer and System Sciences | 2024-12-27 | Paper |
Resource time-sharing for IoT applications with deadlines
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
Precedence-constrained covering problems with multiplicity constraints
Journal of Combinatorial Optimization | 2023-05-05 | Paper |
| Precedence-constrained covering problems with multiplicity constraints | 2022-10-19 | Paper |
Single-item lot-sizing with quantity discount and bounded inventory
Operations Research Letters | 2022-03-11 | Paper |
| Planar Disjoint Paths in Linear Time | 2019-07-12 | Paper |
Finding real-valued single-source shortest paths in \(o(n^3)\) expected time
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Sherali-Adams gaps, flow-cover inequalities and generalized configurations for capacity-constrained facility location
(available as arXiv preprint) | 2017-03-22 | Paper |
Extended formulation lower bounds via hypergraph coloring?
(available as arXiv preprint) | 2017-01-24 | Paper |
Irrelevant vertices for the planar disjoint paths problem
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Planar disjoint-paths completion
Algorithmica | 2016-10-21 | Paper |
Integrality gaps for strengthened linear relaxations of capacitated facility location
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
ACM Transactions on Algorithms | 2014-09-09 | Paper |
The 2-valued case of makespan minimization with assignment constraints
Information Processing Letters | 2013-03-21 | Paper |
Planar disjoint-paths completion
Parameterized and Exact Computation | 2012-06-15 | Paper |
Tight bounds for linkages in planar graphs
Automata, Languages and Programming | 2011-07-06 | Paper |
On the existence of optimal taxes for network congestion games with heterogeneous users
Algorithmic Game Theory | 2010-10-19 | Paper |
Minimum-cost single-source 2-splittable flow
Information Processing Letters | 2009-12-04 | Paper |
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Stackelberg strategies for selfish routing in general multicommodity networks
Algorithmica | 2009-05-13 | Paper |
Edge pricing of multicommodity networks for selfish users with elastic demands
Algorithmica | 2009-04-29 | Paper |
Implementing approximation algorithms for the single-source unsplittable flow problem
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Operations Research Letters | 2008-01-11 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics | 2007-05-30 | Paper |
Minimum-Cost Single-Source 2-Splittable Flow
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Approximation algorithms for minimizing the total weighted tardiness on a single machine
Theoretical Computer Science | 2006-04-28 | Paper |
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences | 2005-12-07 | Paper |
Techniques for scheduling with rejection
Journal of Algorithms | 2004-10-01 | Paper |
Approximating disjoint-path problems using packing integer programs
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics | 2003-09-09 | Paper |
| scientific article; zbMATH DE number 1947426 (Why is no real title available?) | 2003-07-08 | Paper |
Approximation algorithms for single-source unsplittable flow
SIAM Journal on Computing | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1342140 (Why is no real title available?) | 1999-09-22 | Paper |
Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time
Journal of Algorithms | 1999-08-23 | Paper |
| scientific article; zbMATH DE number 1187149 (Why is no real title available?) | 1999-04-19 | Paper |
