Publication | Date of Publication | Type |
---|
https://portal.mardi4nfdi.de/entity/Q6147435 | 2024-01-15 | Paper |
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time | 2023-12-19 | Paper |
Locating service and charging stations | 2023-07-25 | Paper |
Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow | 2023-02-07 | Paper |
Integer plane multiflow maximisation: one-quarter-approximation and gaps | 2022-10-24 | Paper |
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation | 2022-10-14 | Paper |
Fair Division of Indivisible Goods for a Class of Concave Valuations | 2022-08-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q5090960 | 2022-07-21 | Paper |
On fair division for indivisible items | 2022-07-21 | Paper |
Non-Clairvoyant Precedence Constrained Scheduling. | 2022-07-21 | Paper |
Semi-discrete central-upwind Rankine-Hugoniot schemes for hyperbolic systems of conservation laws | 2022-04-21 | Paper |
Godunov-type schemes for the pressureless gas dynamics and related models | 2022-01-27 | Paper |
Parallel Machine Scheduling to Minimize Energy Consumption | 2021-02-02 | Paper |
Fifth-Order A-WENO Finite-Difference Schemes Based on a New Adaptive Diffusion Central Numerical Flux | 2021-01-29 | Paper |
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time | 2020-10-26 | Paper |
A class of upwind methods based on generalized eigenvectors for weakly hyperbolic systems | 2020-02-20 | Paper |
A 4/3-approximation for TSP on cubic 3-edge-connected graphs | 2019-06-11 | Paper |
Multiway cuts in directed and node weighted graphs | 2019-04-29 | Paper |
Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover | 2019-03-29 | Paper |
Rejecting jobs to minimize load and maximum flow-time | 2017-10-11 | Paper |
Rejecting jobs to Minimize Load and Maximum Flow-time | 2017-10-05 | Paper |
New Approximation Schemes for Unsplittable Flow on a Path | 2017-10-05 | Paper |
An upwind method for genuine weakly hyperbolic systems | 2017-03-25 | Paper |
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees | 2017-01-26 | Paper |
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane | 2016-09-01 | Paper |
Use of Jordan forms for convection-pressure split Euler solvers | 2016-07-01 | Paper |
The \(p\)-neighbor \(k\)-center problem | 2016-06-09 | Paper |
Approximate max-flow min-(multi)cut theorems and their applications | 2015-05-07 | Paper |
Local search heuristic for k-median and facility location problems | 2015-02-27 | Paper |
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation | 2015-02-04 | Paper |
Minimizing average flow time on related machines | 2014-11-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q2921764 | 2014-10-13 | Paper |
A 3-approximation algorithm for the facility location problem with uniform capacities | 2013-11-11 | Paper |
A 5-Approximation for Capacitated Facility Location | 2012-09-25 | Paper |
Assigning papers to referees | 2010-10-07 | Paper |
Saving an epsilon | 2010-08-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q3579386 | 2010-08-06 | Paper |
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
Algorithms - ESA 2003 | 2010-03-03 | Paper |
Minimizing Average Flow-Time | 2009-11-12 | Paper |
Better Algorithms for Minimizing Average Flow-Time on Related Machines | 2009-03-12 | Paper |
Minimizing Total Flow-Time: The Unrelated Case | 2009-01-29 | Paper |
Order Scheduling Models: Hardness and Algorithms | 2008-04-24 | Paper |
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems | 2008-04-22 | Paper |
Minimizing stall time in single and parallel disk systems | 2006-09-12 | Paper |
Milling bifurcations from structural asymmetry and nonlinear regeneration | 2006-08-14 | Paper |
Algorithms – ESA 2005 | 2006-06-27 | Paper |
Algorithms – ESA 2004 | 2005-08-18 | Paper |
Local Search Heuristics for k-Median and Facility Location Problems | 2005-02-21 | Paper |
Min-max tree covers of graphs. | 2005-01-11 | Paper |
Multiway cuts in node weighted graphs | 2004-10-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4471338 | 2004-07-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4542564 | 2004-01-27 | Paper |
Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks | 2003-02-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4537744 | 2002-06-20 | Paper |
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem | 2000-11-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q4501673 | 2000-09-04 | Paper |
On the single-source unsplittable flow problem | 1999-12-08 | Paper |
Finding Separator Cuts in Planar Graphs within Twice the Optimal | 1999-10-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4250189 | 1999-06-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4234149 | 1999-03-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q3128882 | 1997-11-18 | Paper |
An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane | 1997-05-29 | Paper |
Primal-dual approximation algorithms for integral flow and multicut in trees | 1997-05-28 | Paper |
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications | 1996-05-13 | Paper |
A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts | 1996-02-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3140408 | 1994-01-02 | Paper |
Symmetrization of matrix technique in a finite element context | 1985-01-01 | Paper |