The following pages link to Christoph Dürr (Q423917):
Displaying 50 items.
- (Q198190) (redirect page) (← links)
- The interval ordering problem (Q423919) (← links)
- Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption (Q499333) (← links)
- Infinite linear programming and online searching with turn cost (Q515543) (← links)
- Finding total unimodularity in optimization problems solved by linear programs (Q627545) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Online maximum matching with recourse (Q830934) (← links)
- A note on scheduling equal-length jobs to maximize throughput (Q880531) (← links)
- The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
- Competitive analysis of scheduling algorithms for aggregated links (Q930606) (← links)
- Tiling with bars under tomographic constraints. (Q1401161) (← links)
- On tiling under tomographic constraints. (Q1401222) (← links)
- Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections (Q1606912) (← links)
- The triangle scheduling problem (Q1617282) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Tile-packing tomography is \(\mathbb{NP}\)-hard (Q1759658) (← links)
- Cellular automata and communication complexity (Q1885923) (← links)
- A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue (Q1939283) (← links)
- Collecting weighted items from a dynamic queue (Q1939667) (← links)
- New results on multi-level aggregation (Q1998855) (← links)
- Scheduling with a processing time oracle (Q2109845) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- Online clique clustering (Q2300728) (← links)
- Online bin packing with advice of small size (Q2322702) (← links)
- A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines (Q2356122) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- The local-global conjecture for scheduling with non-linear cost (Q2400434) (← links)
- Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling (Q2402672) (← links)
- Online scheduling of bounded length jobs to maximize throughput (Q2434304) (← links)
- Runway sequencing with holding patterns (Q2482798) (← links)
- Randomized two-valued bounded delay online buffer management (Q2661627) (← links)
- A Decision Procedure for Unitary Linear Quantum Cellular Automata (Q2784493) (← links)
- Approximating the Throughput by Coolest First Scheduling (Q2848925) (← links)
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography (Q2902905) (← links)
- Competitive Strategies for Online Clique Clustering (Q2947013) (← links)
- Polynomial-time algorithms for minimum energy scheduling (Q3189067) (← links)
- Online Bin Packing with Advice of Small Size (Q3449804) (← links)
- Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems (Q3511421) (← links)
- Competitive Analysis of Scheduling Algorithms for Aggregated Links (Q3525795) (← links)
- Nash Equilibria in Voronoi Games on Graphs (Q3527197) (← links)
- Polynomial Time Algorithms for Minimum Energy Scheduling (Q3527206) (← links)
- Online Scheduling of Bounded Length Jobs to Maximize Throughput (Q3558919) (← links)
- Tile-Packing Tomography Is ${\mathbb{NP}}$ -hard (Q3578325) (← links)
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard (Q3639290) (← links)
- Non-clairvoyant Scheduling Games (Q3648849) (← links)
- A decision procedure for well-formed linear quantum cellular automata (Q4372789) (← links)
- A decision procedure for well-formed linear quantum cellular automata (Q4593939) (← links)
- The expanding search ratio of a graph (Q4601858) (← links)
- (Q4606281) (← links)
