| Publication | Date of Publication | Type |
|---|
On approximating partial scenario set cover
Theoretical Computer Science | 2024-12-12 | Paper |
A bicriteria almost equal minimum cost flow model for day-ahead trading
| 2024-09-17 | Paper |
On the mixed connectivity conjecture of Beineke and Harary
Annals of Operations Research | 2024-09-03 | Paper |
Modifying networks to obtain low cost trees
| 2024-06-05 | Paper |
Algorithms and complexity for the almost equal maximum flow problem
Networks | 2024-05-17 | Paper |
Complexity and approximability of certain bicriteria location problems
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Almost disjoint paths and separating by forbidden pairs
Theoretical Computer Science | 2024-02-23 | Paper |
Compact location problems with budget and communication constraints
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Robust flows with adaptive mitigation
EURO Journal on Computational Optimization | 2023-07-12 | Paper |
2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
Operations Research Letters | 2022-12-12 | Paper |
Towards obtaining a 3-decomposition from a perfect matching
The Electronic Journal of Combinatorics | 2022-11-08 | Paper |
Online algorithms to schedule a proportionate flexible flow shop of batching machines
Journal of Scheduling | 2022-11-04 | Paper |
Simultaneously dominating all spanning trees of a graph
Electronic Journal of Graph Theory and Applications | 2022-06-14 | Paper |
The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
| 2021-08-30 | Paper |
Algorithms and complexity for the almost equal maximum flow problem
| 2021-08-30 | Paper |
Robust single machine makespan scheduling with release date uncertainty
Operations Research Letters | 2021-04-07 | Paper |
Scheduling a proportionate flow shop of batching machines
Journal of Scheduling | 2020-12-11 | Paper |
On the Bicriterion Maximum Flow Network Interdiction Problem
| 2020-10-06 | Paper |
Towards obtaining a 3-Decomposition from a perfect Matching
| 2020-08-21 | Paper |
Robust Single Machine Makespan Scheduling with Release Date Uncertainty
| 2020-07-27 | Paper |
Robust absolute single machine makespan scheduling-location problem on trees
Operations Research Letters | 2020-02-11 | Paper |
An FPTAS for the knapsack problem with parametric weights
Operations Research Letters | 2020-02-10 | Paper |
On the Mixed Connectivity Conjecture of Beineke and Harary
| 2019-08-30 | Paper |
Full implementation of social choice functions in dominant strategies
International Journal of Game Theory | 2019-06-24 | Paper |
Robust multicovers with budgeted uncertainty
European Journal of Operational Research | 2019-01-09 | Paper |
Improving spanning trees by upgrading nodes
Automata, Languages and Programming | 2018-07-04 | Paper |
A network simplex method for the budget-constrained minimum cost flow problem
European Journal of Operational Research | 2018-05-25 | Paper |
Robust bottleneck routing games
Networks | 2018-05-23 | Paper |
Capacitated network design games with weighted players
Networks | 2018-05-23 | Paper |
A generalized approximation framework for fractional network flow and packing problems
Mathematical Methods of Operations Research | 2018-02-09 | Paper |
Maximum flows in generalized processing networks
Journal of Combinatorial Optimization | 2017-08-03 | Paper |
On the complexity and approximability of budget-constrained minimum cost flows
Information Processing Letters | 2017-06-30 | Paper |
An FPTAS for the parametric knapsack problem
Information Processing Letters | 2017-06-30 | Paper |
Minimum Cycle Decomposition: A Constructive Characterization for Graphs of Treewidth Two with Node Degrees Two and Four
| 2017-01-19 | Paper |
On the online min-wait relocation problem
| 2016-10-17 | Paper |
The Canadian tour operator problem on paths: tight bounds and resource augmentation
Journal of Combinatorial Optimization | 2016-10-12 | Paper |
Computation of equilibria and the price of anarchy in bottleneck congestion games
CEJOR. Central European Journal of Operations Research | 2016-06-30 | Paper |
Robust optimization for routing problems on trees
Top | 2016-06-30 | Paper |
Budget-constrained minimum cost flows
Journal of Combinatorial Optimization | 2016-05-11 | Paper |
The generalized assignment problem with minimum quantities
European Journal of Operational Research | 2016-03-15 | Paper |
Static and dynamic source locations in undirected networks
Top | 2015-11-06 | Paper |
Rejoinder on: ``Static and dynamic source locations in undirected networks
Top | 2015-11-06 | Paper |
Convex generalized flows
Discrete Applied Mathematics | 2015-07-06 | Paper |
Stability with Uniform Bounds for On-line Dial-a-Ride Problems under Reasonable Load
Distributed Decision Making and Control | 2015-06-24 | Paper |
Generalized max flow in series-parallel graphs
Discrete Optimization | 2014-04-15 | Paper |
Minimum cost flows with minimum quantities
Information Processing Letters | 2013-03-28 | Paper |
scientific article; zbMATH DE number 6114341 (Why is no real title available?)
| 2012-12-08 | Paper |
Approximating infeasible 2VPI-systems
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Graph-theoretic concepts and algorithms
Leitfäden der Informatik | 2012-10-02 | Paper |
Erratum to ``Minimum cost flows with minimum quantities
Information Processing Letters | 2012-07-25 | Paper |
The online TSP against fair adversaries
INFORMS Journal on Computing | 2012-05-30 | Paper |
Selfish bin coloring
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
Truthful mechanisms for selfish routing and two-parameter agents
Theory of Computing Systems | 2011-11-23 | Paper |
Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization
Mathematical Methods of Operations Research | 2011-09-20 | Paper |
Interval scheduling on related machines
Computers \& Operations Research | 2011-06-30 | Paper |
MIP Formulations for Flowshop Scheduling with Limited Buffers
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
Computers \& Operations Research | 2011-03-25 | Paper |
New lower bounds for online \(k\)-server routing problems
Information Processing Letters | 2010-08-16 | Paper |
Clever or smart: strategies for the online target date assignment problem
Discrete Applied Mathematics | 2010-05-05 | Paper |
Truthful mechanisms for selfish routing and two-parameter agents
Algorithmic Game Theory | 2009-12-01 | Paper |
How hard is it to find extreme Nash equilibria in network congestion games?
Theoretical Computer Science | 2009-11-06 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Online Job Admission
Fundamental Problems in Computing | 2009-08-05 | Paper |
Semi-preemptive routing on trees
Discrete Applied Mathematics | 2009-03-04 | Paper |
A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
Approximation and Online Algorithms | 2009-02-12 | Paper |
scientific article; zbMATH DE number 5494094 (Why is no real title available?)
| 2009-01-20 | Paper |
Bincoloring
Theoretical Computer Science | 2008-11-18 | Paper |
Approximation algorithms for a vehicle routing problem
Mathematical Methods of Operations Research | 2008-11-17 | Paper |
Pruning in column generation for service vehicle dispatching
Annals of Operations Research | 2008-09-03 | Paper |
A monotone approximation algorithm for scheduling with precedence constraints
Operations Research Letters | 2008-08-06 | Paper |
Online-Optimization of Large-Scale Vehicle Dispatching Problems
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Competitive Algorithms for Cottage Rental
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A hard dial-a-ride problem that is easy on average
Journal of Scheduling | 2007-05-15 | Paper |
Budget constrained minimum cost connected medians
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
Journal of Algorithms | 2006-12-07 | Paper |
How to whack moles
Theoretical Computer Science | 2006-09-14 | Paper |
Reoptimization gaps versus model errors in online-dispatching of service units for ADAC
Discrete Applied Mathematics | 2006-08-17 | Paper |
On budget-constrained flow improvement.
Information Processing Letters | 2006-01-17 | Paper |
scientific article; zbMATH DE number 2230219 (Why is no real title available?)
| 2005-11-18 | Paper |
scientific article; zbMATH DE number 2202358 (Why is no real title available?)
| 2005-09-05 | Paper |
scientific article; zbMATH DE number 2119670 (Why is no real title available?)
| 2004-11-29 | Paper |
scientific article; zbMATH DE number 2050722 (Why is no real title available?)
| 2004-03-07 | Paper |
scientific article; zbMATH DE number 2044936 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 1487870 (Why is no real title available?)
| 2003-08-26 | Paper |
News from the online traveling repairman.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1953105 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1953104 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1947428 (Why is no real title available?)
| 2003-07-08 | Paper |
scientific article; zbMATH DE number 1947058 (Why is no real title available?)
| 2003-07-07 | Paper |
scientific article; zbMATH DE number 1875408 (Why is no real title available?)
| 2003-03-02 | Paper |
scientific article; zbMATH DE number 1834671 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1696540 (Why is no real title available?)
| 2002-07-22 | Paper |
Models and approximation algorithms for channel assignment in radio networks
Wireless Networks | 2002-02-27 | Paper |
scientific article; zbMATH DE number 1688604 (Why is no real title available?)
| 2002-02-21 | Paper |
Euler is standing in line dial-a-ride problems with precedence-constraints
Discrete Applied Mathematics | 2001-11-12 | Paper |
scientific article; zbMATH DE number 1629830 (Why is no real title available?)
| 2001-11-06 | Paper |
scientific article; zbMATH DE number 1629852 (Why is no real title available?)
| 2001-11-06 | Paper |
scientific article; zbMATH DE number 1629851 (Why is no real title available?)
| 2001-11-04 | Paper |
Upgrading bottleneck constrained forests
Discrete Applied Mathematics | 2001-10-30 | Paper |
scientific article; zbMATH DE number 1688603 (Why is no real title available?)
| 2001-01-01 | Paper |
scientific article; zbMATH DE number 1487883 (Why is no real title available?)
| 2000-08-10 | Paper |
On the minimum label spanning tree problem
Information Processing Letters | 2000-06-20 | Paper |
scientific article; zbMATH DE number 1420897 (Why is no real title available?)
| 2000-06-07 | Paper |
Improving Minimum Cost Spanning Trees by Upgrading Nodes
Journal of Algorithms | 2000-02-06 | Paper |
Improving spanning trees by upgrading nodes
Theoretical Computer Science | 2000-01-12 | Paper |
scientific article; zbMATH DE number 1153938 (Why is no real title available?)
| 1999-08-10 | Paper |
Approximation algorithms for certain network improvement problems
Journal of Combinatorial Optimization | 1999-03-28 | Paper |
scientific article; zbMATH DE number 1262800 (Why is no real title available?)
| 1999-03-15 | Paper |
Modifying edges of a network to obtain short subgraphs
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1076395 (Why is no real title available?)
| 1998-10-12 | Paper |
scientific article; zbMATH DE number 1163718 (Why is no real title available?)
| 1998-08-04 | Paper |
Compact location problems
Theoretical Computer Science | 1998-07-22 | Paper |
scientific article; zbMATH DE number 1076397 (Why is no real title available?)
| 1998-04-22 | Paper |
