| Publication | Date of Publication | Type |
|---|
Approximating connected maximum cuts via local search
| 2025-01-06 | Paper |
The preemptive resource allocation problem
Journal of Scheduling | 2024-05-30 | Paper |
Quick minimization of tardy processing time on a single machine
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Interweaving real-time jobs with energy harvesting to maximize throughput
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Maximizing Throughput in Flow Shop Real-Time Scheduling
| 2023-10-31 | Paper |
scientific article; zbMATH DE number 7650323 (Why is no real title available?)
| 2023-02-03 | Paper |
Approximating minimum feedback sets and multi-cuts in directed graphs (extended summary)
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
scientific article; zbMATH DE number 7525506 (Why is no real title available?)
| 2022-05-11 | Paper |
Generalized assignment of time-sensitive item groups
| 2021-08-04 | Paper |
Fully dynamic MIS in uniformly sparse graphs
| 2021-07-28 | Paper |
Fully dynamic MIS in uniformly sparse graphs
ACM Transactions on Algorithms | 2021-05-03 | Paper |
The Euclidean \(k\)-supplier problem
Mathematics of Operations Research | 2020-04-30 | Paper |
Constrained submodular maximization via greedy local search
Operations Research Letters | 2020-02-10 | Paper |
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Real-time \(k\)-bounded preemptive scheduling
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Fully dynamic maximal independent set with sublinear update time
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
All-or-nothing generalized assignment with application to scheduling advertising campaigns
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Throughput maximization of real-time scheduling with batching
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Complexity and inapproximability results for the power edge set problem
Journal of Combinatorial Optimization | 2018-04-13 | Paper |
A theory and algorithms for combinatorial reoptimization
Algorithmica | 2018-04-06 | Paper |
Fast deflection routing for packets and worms
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
The container selection problem
| 2017-08-31 | Paper |
Efficient recovery from power outage (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Approximating the throughput of multiple machines under real-time scheduling
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
A tight bound for approximating the square root
Information Processing Letters | 2016-05-26 | Paper |
Competitive dynamic bandwidth allocation
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
Real-time scheduling to minimize machine busy times
Journal of Scheduling | 2016-01-22 | Paper |
A unified approach to approximating resource allocation and scheduling
Journal of the ACM | 2015-10-30 | Paper |
scientific article; zbMATH DE number 6472596 (Why is no real title available?)
| 2015-08-14 | Paper |
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
| 2015-08-03 | Paper |
Online server allocation in a server farm via benefit task systems
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Buffer overflow management in QoS switches
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Dynamic pricing for impatient bidders
| 2014-12-18 | Paper |
A quasi-PTAS for unsplittable flow on line graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Dynamic pricing for impatient bidders
ACM Transactions on Algorithms | 2014-11-18 | Paper |
A unified approach to approximating resource allocation and scheduling
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Improved approximations of crossings in graph drawings
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
The Approximability of the Binary Paintshop Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
The Euclidean \(k\)-supplier problem
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
All-or-nothing generalized assignment with application to scheduling advertising campaigns
Integer Programming and Combinatorial Optimization | 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
Algorithmica | 2011-05-10 | Paper |
Sparse LCS Common Substring Alignment
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Sparse LCS common substring alignment
Information Processing Letters | 2009-07-09 | Paper |
Traffic engineering of management flows by link augmentations on confluent trees
Theory of Computing Systems | 2008-02-18 | Paper |
Minimizing Setup and Beam-On Times in Radiation Therapy
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
Journal of Scheduling | 2007-05-15 | Paper |
Minimizing Service and Operation Costs of Periodic Scheduling
Mathematics of Operations Research | 2005-11-11 | Paper |
Computing the minimum DNF representation of Boolean functions defined by intervals
Discrete Applied Mathematics | 2005-09-02 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2119735 (Why is no real title available?)
| 2004-11-29 | Paper |
A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
Journal of Scheduling | 2003-08-21 | Paper |
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
SIAM Journal on Computing | 2003-06-19 | Paper |
The edge versus path incidence matrix of series-parallel graphs and greedy packing
Discrete Applied Mathematics | 2002-08-28 | Paper |
Approximating the throughput of multiple machines in real-time scheduling
SIAM Journal on Computing | 2002-04-23 | Paper |
scientific article; zbMATH DE number 1263238 (Why is no real title available?)
| 2002-02-03 | Paper |
scientific article; zbMATH DE number 1256664 (Why is no real title available?)
| 2002-01-16 | Paper |
Message Multicasting in Heterogeneous Networks
SIAM Journal on Computing | 2000-10-18 | Paper |
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
The Angular-Metric Traveling Salesman Problem
SIAM Journal on Computing | 2000-03-19 | Paper |
Optimal multiple message broadcasting in telephone-like communication systems
Discrete Applied Mathematics | 2000-01-30 | Paper |
Bandwidth Allocation with Preemption
SIAM Journal on Computing | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1303536 (Why is no real title available?)
| 1999-08-16 | Paper |
Lower bounds on the depth of monotone arithmetic computations
Journal of Complexity | 1999-05-11 | Paper |
scientific article; zbMATH DE number 1256696 (Why is no real title available?)
| 1999-04-22 | Paper |
Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
Journal of Algorithms | 1999-01-17 | Paper |
Guaranteeing Fair Service to Persistent Dependent Tasks
SIAM Journal on Computing | 1998-09-20 | Paper |
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
SIAM Journal on Computing | 1998-09-20 | Paper |
How much can hardware help routing?
Journal of the ACM | 1998-02-17 | Paper |
Efficient routing in optical networks
Journal of the ACM | 1998-01-22 | Paper |
Approximating minimum feedback sets and multicuts in directed graphs
Algorithmica | 1998-01-01 | Paper |
scientific article; zbMATH DE number 1775430 (Why is no real title available?)
| 1998-01-01 | Paper |
Navigating in Unfamiliar Geometric Terrain
SIAM Journal on Computing | 1997-08-07 | Paper |
A linear-time algorithm for computing the intersection of all odd cycles in a graph
Discrete Applied Mathematics | 1997-08-03 | Paper |
scientific article; zbMATH DE number 1003273 (Why is no real title available?)
| 1997-06-02 | Paper |
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
Journal of Algorithms | 1996-11-04 | Paper |
scientific article; zbMATH DE number 910880 (Why is no real title available?)
| 1996-10-13 | Paper |
scientific article; zbMATH DE number 910897 (Why is no real title available?)
| 1996-08-22 | Paper |
A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET
International Journal of Computational Geometry & Applications | 1996-08-12 | Paper |
Calling names on nameless networks
Information and Computation | 1996-02-26 | Paper |
Optimal computation of census functions in the postal model
Discrete Applied Mathematics | 1996-02-26 | Paper |
scientific article; zbMATH DE number 826056 (Why is no real title available?)
| 1995-12-13 | Paper |
A lower bound for integer greatest common divisor computations
Journal of the ACM | 1995-08-31 | Paper |
Competitive paging with locality of reference
Journal of Computer and System Sciences | 1995-06-08 | Paper |
Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
Discrete & Computational Geometry | 1994-11-27 | Paper |
The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels
Journal of the ACM | 1994-08-21 | Paper |
A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle
Algorithmica | 1994-07-21 | Paper |
scientific article; zbMATH DE number 432797 (Why is no real title available?)
| 1994-04-13 | Paper |
IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS
International Journal of Computational Geometry & Applications | 1993-10-24 | Paper |
scientific article; zbMATH DE number 432827 (Why is no real title available?)
| 1993-10-20 | Paper |
Fast exponentiation using the truncation operation
Computational Complexity | 1993-06-29 | Paper |
Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
Journal of Algorithms | 1993-06-29 | Paper |
Fast geometric approximation techniques and geometric embedding problems
Theoretical Computer Science | 1993-04-22 | Paper |
On independent spanning trees
Information Processing Letters | 1993-01-16 | Paper |
scientific article; zbMATH DE number 65707 (Why is no real title available?)
| 1992-09-27 | Paper |
scientific article; zbMATH DE number 65704 (Why is no real title available?)
| 1992-09-27 | Paper |
An efficient algorithm for the all pairs suffix-prefix problem
Information Processing Letters | 1992-09-26 | Paper |
Computing external farthest neighbors for a simple polygon
Discrete Applied Mathematics | 1992-06-25 | Paper |
Efficient Parallel Algorithms for Testingkand Finding Disjoints-tPaths in Graphs
SIAM Journal on Computing | 1991-01-01 | Paper |
Lower Bounds for Computations with the Floor Operation
SIAM Journal on Computing | 1991-01-01 | Paper |
On-line dynamic programming with applications to the prediction of RNA secondary structure
Journal of Algorithms | 1991-01-01 | Paper |
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
Discrete Applied Mathematics | 1990-01-01 | Paper |
The power of multimedia: Combining point-to-point and multi-access networks
Information and Computation | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4117838 (Why is no real title available?)
| 1989-01-01 | Paper |
Finding the edge connectivity of directed graphs
Journal of Algorithms | 1989-01-01 | Paper |
Parallel construction of a suffix tree with applications
Algorithmica | 1988-01-01 | Paper |
On Finding Lowest Common Ancestors: Simplification and Parallelization
SIAM Journal on Computing | 1988-01-01 | Paper |
On finding most uniform spanning trees
Discrete Applied Mathematics | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4064469 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4047160 (Why is no real title available?)
| 1987-01-01 | Paper |
Parallel ear decomposition search (EDS) and st-numbering in graphs
Theoretical Computer Science | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3958744 (Why is no real title available?)
| 1986-01-01 | Paper |
