| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147528 | 2024-01-15 | Paper |
| Degree realization by bipartite multigraphs | 2024-01-11 | Paper |
| Weighted microscopic image reconstruction | 2024-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059166 | 2023-11-02 | Paper |
| Graph realizations: maximum degree in vertex neighborhoods | 2023-06-12 | Paper |
| Forcibly bipartite and acyclic (uni-)graphic sequences | 2023-05-15 | Paper |
| On vertex-weighted graph realizations | 2023-03-22 | Paper |
| Composed degree-distance realizations of graphs | 2023-03-09 | Paper |
| Overflow management with self-eliminations | 2023-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874474 | 2023-02-07 | Paper |
| The Generalized Microscopic Image Reconstruction Problem | 2023-02-03 | Paper |
| Efficiently Realizing Interval Sequences | 2023-02-03 | Paper |
| Maximizing Barrier Coverage Lifetime with Static Sensors | 2022-12-09 | Paper |
| Randomized strategies for non-additive 3-slope ski rental | 2022-11-11 | Paper |
| Maximizing barrier coverage lifetime with static sensors | 2022-11-04 | Paper |
| The generalized microscopic image reconstruction problem | 2022-09-15 | Paper |
| Vertex-weighted graphs: realizable and unrealizable domains | 2022-07-13 | Paper |
| Overflow management with self-eliminations | 2022-06-24 | Paper |
| On vertex-weighted realizations of acyclic and general graphs | 2022-06-13 | Paper |
| Weighted microscopic image reconstruction | 2022-03-24 | Paper |
| Relaxed and approximate graph realizations | 2022-03-22 | Paper |
| Composed degree-distance realizations of graphs | 2022-03-22 | Paper |
| Online budgeted maximum coverage | 2021-09-02 | Paper |
| ``Green barrier coverage with mobile sensors | 2021-03-09 | Paper |
| Efficiently Realizing Interval Sequences | 2020-12-04 | Paper |
| Simple and local independent set approximation | 2020-11-06 | Paper |
| Local search algorithms for the maximum carpool matching problem | 2020-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111744 | 2020-05-27 | Paper |
| Vertex-weighted realizations of graphs | 2020-01-22 | Paper |
| Service chain placement in SDNs | 2019-11-06 | Paper |
| Graph profile realizations and applications to social networks | 2019-10-15 | Paper |
| Brief Announcement | 2019-09-19 | Paper |
| Distributed approximation of \(k\)-service assignment | 2019-03-21 | Paper |
| Realizability of graph specifications: characterizations and algorithms | 2019-01-30 | Paper |
| Simple and local independent set approximation | 2019-01-30 | Paper |
| Flexible cell selection in cellular networks | 2018-12-07 | Paper |
| Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs | 2018-11-05 | Paper |
| Flexible allocation on related machines with assignment restrictions | 2018-10-26 | Paper |
| Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks | 2018-08-07 | Paper |
| 1.5-approximation algorithm for the 2-convex recoloring problem | 2018-06-27 | Paper |
| Distributed backup placement in networks | 2018-04-11 | Paper |
| Online Budgeted Maximum Coverage | 2018-03-02 | Paper |
| Set it and forget it: approximating the set once strip cover problem | 2017-10-10 | Paper |
| Distributed Approximation of k-Service Assignment | 2017-09-29 | Paper |
| Maximizing Barrier Coverage Lifetime with Mobile Sensors | 2017-05-24 | Paper |
| A constant factor approximation algorithm for the storage allocation problem | 2017-05-02 | Paper |
| Shrinking maxima, decreasing costs: new online packing and covering problems | 2016-05-31 | Paper |
| 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem | 2016-04-04 | Paper |
| Changing of the guards: strip cover with duty cycling | 2015-12-10 | Paper |
| “Green” Barrier Coverage with Mobile Sensors | 2015-09-21 | Paper |
| Bandwidth allocation in cellular networks with multiple interferences | 2015-09-01 | Paper |
| The hardness of cache conscious data placement | 2015-03-17 | Paper |
| Online set packing and competitive scheduling of multi-part tasks | 2015-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934605 | 2014-12-18 | Paper |
| Time-dependent multi-scheduling of multicast | 2014-11-18 | Paper |
| Optimization problems in multiple-interval graphs | 2014-11-18 | Paper |
| Optimization problems in dotted interval graphs | 2014-08-22 | Paper |
| Competitive router scheduling with structured data | 2014-03-27 | Paper |
| Online scheduling with interval conflicts | 2013-10-21 | Paper |
| Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems | 2013-10-04 | Paper |
| Maximizing Barrier Coverage Lifetime with Mobile Sensors | 2013-09-17 | Paper |
| Capacitated Arc Stabbing | 2013-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910746 | 2013-03-19 | Paper |
| A note on multicovering with disks | 2013-01-25 | Paper |
| Online Set Packing | 2012-11-29 | Paper |
| Optimization Problems in Dotted Interval Graphs | 2012-11-06 | Paper |
| Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs | 2012-11-01 | Paper |
| Changing of the Guards: Strip Cover with Duty Cycling | 2012-09-26 | Paper |
| Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental | 2012-09-12 | Paper |
| Competitive Router Scheduling with Structured Data | 2012-07-16 | Paper |
| Distributed approximation of cellular coverage | 2012-07-13 | Paper |
| Vector bin packing with multiple-choice | 2012-06-18 | Paper |
| Partial multicovering and the \(d\)-consecutive ones property | 2012-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113712 | 2012-01-23 | Paper |
| Minimum vertex cover in rectangle graphs | 2011-07-20 | Paper |
| Approximation of Partial Capacitated Vertex Cover | 2011-07-18 | Paper |
| Video distribution under multiple constraints | 2011-07-14 | Paper |
| Optimization problems in multiple subtree graphs | 2011-04-19 | Paper |
| An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications | 2011-03-15 | Paper |
| Minimum Vertex Cover in Rectangle Graphs | 2010-09-06 | Paper |
| Vector Bin Packing with Multiple-Choice | 2010-06-22 | Paper |
| Ski rental with two general options | 2010-06-09 | Paper |
| Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications | 2010-05-11 | Paper |
| Optimization Problems in Multiple Subtree Graphs | 2010-05-11 | Paper |
| Hitting sets when the VC-dimension is small | 2009-12-04 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Resource allocation in bounded degree trees | 2009-06-16 | Paper |
| The minimum substring cover problem | 2008-12-03 | Paper |
| On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems | 2008-12-03 | Paper |
| On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems | 2008-09-25 | Paper |
| Approximation of Partial Capacitated Vertex Cover | 2008-09-25 | Paper |
| Approximating the 2-interval pattern problem | 2008-07-10 | Paper |
| Improved approximation algorithm for convex recoloring of trees | 2008-06-06 | Paper |
| Resource Allocation in Bounded Degree Trees | 2008-03-11 | Paper |
| The Minimum Substring Cover Problem | 2008-02-20 | Paper |
| Admission control with advance reservations in simple networks | 2008-01-11 | Paper |
| Approximation Algorithms for Capacitated Rectangle Stabbing | 2007-05-02 | Paper |
| Using fractional primal-dual to schedule split intervals with demands | 2007-02-20 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374247 | 2006-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3369935 | 2006-02-06 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Local ratio with negative weights. | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780780 | 2002-11-21 | Paper |
| Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property | 2002-08-14 | Paper |
| Efficient algorithms for integer programs with two variables per constraint. | 2001-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938772 | 2000-06-05 | Paper |
