| Publication | Date of Publication | Type |
|---|
| Approximating connected maximum cuts via local search | 2025-01-06 | Paper |
| The preemptive resource allocation problem | 2024-05-30 | Paper |
| Quick minimization of tardy processing time on a single machine | 2024-01-16 | Paper |
| Interweaving real-time jobs with energy harvesting to maximize throughput | 2023-11-24 | Paper |
| Maximizing Throughput in Flow Shop Real-Time Scheduling | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875660 | 2023-02-03 | Paper |
| Approximating minimum feedback sets and multi-cuts in directed graphs | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075815 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009517 | 2021-08-04 | Paper |
| Fully dynamic MIS in uniformly sparse graphs | 2021-07-28 | Paper |
| Fully Dynamic MIS in Uniformly Sparse Graphs | 2021-05-03 | Paper |
| The Euclidean k-Supplier Problem | 2020-04-30 | Paper |
| Constrained submodular maximization via greedy local search | 2020-02-10 | Paper |
| Fully Dynamic Maximal Independent Set with Sublinear in n Update Time | 2019-10-15 | Paper |
| Real-Time k-bounded Preemptive Scheduling | 2019-09-12 | Paper |
| Fully dynamic maximal independent set with sublinear update time | 2019-08-22 | Paper |
| Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs | 2018-11-05 | Paper |
| All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns | 2018-11-05 | Paper |
| Throughput maximization of real-time scheduling with batching | 2018-11-05 | Paper |
| Complexity and inapproximability results for the power edge set problem | 2018-04-13 | Paper |
| A theory and algorithms for combinatorial reoptimization | 2018-04-06 | Paper |
| Fast deflection routing for packets and worms | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351914 | 2017-08-31 | Paper |
| Efficient recovery from power outage (extended abstract) | 2016-09-29 | Paper |
| Approximating the throughput of multiple machines under real-time scheduling | 2016-09-29 | Paper |
| A tight bound for approximating the square root | 2016-05-26 | Paper |
| Competitive dynamic bandwidth allocation | 2016-03-02 | Paper |
| Real-time scheduling to minimize machine busy times | 2016-01-22 | Paper |
| A unified approach to approximating resource allocation and scheduling | 2015-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501799 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501361 | 2015-08-03 | Paper |
| Online server allocation in a server farm via benefit task systems | 2015-02-27 | Paper |
| Buffer overflow management in QoS switches | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934659 | 2014-12-18 | Paper |
| A quasi-PTAS for unsplittable flow on line graphs | 2014-11-25 | Paper |
| Dynamic pricing for impatient bidders | 2014-11-18 | Paper |
| A unified approach to approximating resource allocation and scheduling | 2014-09-26 | Paper |
| Improved approximations of crossings in graph drawings | 2014-09-26 | Paper |
| The Approximability of the Binary Paintshop Problem | 2013-10-04 | Paper |
| The Euclidean k-Supplier Problem | 2013-03-19 | Paper |
| All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns | 2013-03-19 | Paper |
| Minimizing busy time in multiple machine real-time scheduling | 2012-08-29 | Paper |
| Shape rectangularization problems in intensity-modulated radiation therapy | 2011-05-10 | Paper |
| Sparse LCS Common Substring Alignment | 2010-04-06 | Paper |
| Sparse LCS common substring alignment | 2009-07-09 | Paper |
| Traffic engineering of management flows by link augmentations on confluent trees | 2008-02-18 | Paper |
| Minimizing Setup and Beam-On Times in Radiation Therapy | 2007-08-28 | Paper |
| Minimizing migrations in fair multiprocessor scheduling of persistent tasks | 2007-05-15 | Paper |
| Minimizing Service and Operation Costs of Periodic Scheduling | 2005-11-11 | Paper |
| Computing the minimum DNF representation of Boolean functions defined by intervals | 2005-09-02 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Buffer Overflow Management in QoS Switches | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829010 | 2004-11-29 | Paper |
| A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness | 2003-08-21 | Paper |
| Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas | 2003-06-19 | Paper |
| The edge versus path incidence matrix of series-parallel graphs and greedy packing | 2002-08-28 | Paper |
| Approximating the throughput of multiple machines in real-time scheduling | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234111 | 2002-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230351 | 2002-01-16 | Paper |
| Message Multicasting in Heterogeneous Networks | 2000-10-18 | Paper |
| Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications | 2000-07-20 | Paper |
| The Angular-Metric Traveling Salesman Problem | 2000-03-19 | Paper |
| Optimal multiple message broadcasting in telephone-like communication systems | 2000-01-30 | Paper |
| Bandwidth Allocation with Preemption | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250158 | 1999-08-16 | Paper |
| Lower bounds on the depth of monotone arithmetic computations | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228432 | 1999-04-22 | Paper |
| Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property | 1999-01-17 | Paper |
| Guaranteeing Fair Service to Persistent Dependent Tasks | 1998-09-20 | Paper |
| A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity | 1998-09-20 | Paper |
| How much can hardware help routing? | 1998-02-17 | Paper |
| Efficient routing in optical networks | 1998-01-22 | Paper |
| Approximating minimum feedback sets and multicuts in directed graphs | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542563 | 1998-01-01 | Paper |
| Navigating in Unfamiliar Geometric Terrain | 1997-08-07 | Paper |
| A linear-time algorithm for computing the intersection of all odd cycles in a graph | 1997-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128902 | 1997-06-02 | Paper |
| Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886054 | 1996-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886072 | 1996-08-22 | Paper |
| A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET | 1996-08-12 | Paper |
| Calling names on nameless networks | 1996-02-26 | Paper |
| Optimal computation of census functions in the postal model | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858442 | 1995-12-13 | Paper |
| A lower bound for integer greatest common divisor computations | 1995-08-31 | Paper |
| Competitive paging with locality of reference | 1995-06-08 | Paper |
| Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications | 1994-11-27 | Paper |
| The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels | 1994-08-21 | Paper |
| A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle | 1994-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138930 | 1994-04-13 | Paper |
| IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138961 | 1993-10-20 | Paper |
| Fast exponentiation using the truncation operation | 1993-06-29 | Paper |
| Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values | 1993-06-29 | Paper |
| Fast geometric approximation techniques and geometric embedding problems | 1993-04-22 | Paper |
| On independent spanning trees | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010318 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010315 | 1992-09-27 | Paper |
| An efficient algorithm for the all pairs suffix-prefix problem | 1992-09-26 | Paper |
| Computing external farthest neighbors for a simple polygon | 1992-06-25 | Paper |
| Efficient Parallel Algorithms for Testingkand Finding Disjoints-tPaths in Graphs | 1991-01-01 | Paper |
| Lower Bounds for Computations with the Floor Operation | 1991-01-01 | Paper |
| On-line dynamic programming with applications to the prediction of RNA secondary structure | 1991-01-01 | Paper |
| Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm | 1990-01-01 | Paper |
| The power of multimedia: Combining point-to-point and multi-access networks | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732103 | 1989-01-01 | Paper |
| Finding the edge connectivity of directed graphs | 1989-01-01 | Paper |
| Parallel construction of a suffix tree with applications | 1988-01-01 | Paper |
| On Finding Lowest Common Ancestors: Simplification and Parallelization | 1988-01-01 | Paper |
| On finding most uniform spanning trees | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798229 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783605 | 1987-01-01 | Paper |
| Parallel ear decomposition search (EDS) and st-numbering in graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727398 | 1986-01-01 | Paper |
