The following pages link to Marek Chrobak (Q287139):
Displayed 50 items.
- Collecting weighted items from a dynamic queue (Q1939667) (← links)
- Approximation algorithms for the fault-tolerant facility placement problem (Q1944947) (← links)
- New results on multi-level aggregation (Q1998855) (← links)
- On the cost of unsuccessful searches in search trees with two-way comparisons (Q2051772) (← links)
- Information gathering in ad-hoc radio networks (Q2051793) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- On Huang and Wong's algorithm for generalized binary split trees (Q2089746) (← links)
- Towards a theory of mixing graphs: a characterization of perfect mixability (Q2207499) (← links)
- Towards a theory of mixing graphs: a characterization of perfect mixability (extended abstract) (Q2294050) (← links)
- Online clique clustering (Q2300728) (← links)
- A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines (Q2356122) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- Online packet scheduling with bounded delay and lookahead (Q2419122) (← links)
- Algorithms for placing monitors in a flow network (Q2441585) (← links)
- Online competitive algorithms for maximizing weighted throughput of unit jobs (Q2458928) (← links)
- Incremental medians via online bidding (Q2482726) (← links)
- Online Control Message Aggregation in Chain Networks (Q2842151) (← links)
- Information Gathering in Ad-Hoc Radio Networks with Tree Topology (Q2942388) (← links)
- The greedy algorithm for the minimum common string partition problem (Q2944502) (← links)
- Competitive Strategies for Online Clique Clustering (Q2947013) (← links)
- Scheduling with Gaps: New Models and Algorithms (Q2947014) (← links)
- Better Bounds for Incremental Frequency Allocation in Bipartite Graphs (Q3092234) (← links)
- Two-Bounded-Space Bin Packing Revisited (Q3092235) (← links)
- (Q3138950) (← links)
- Fast broadcasting and gossiping in radio networks (Q3150281) (← links)
- (Q3183008) (← links)
- Polynomial-time algorithms for minimum energy scheduling (Q3189067) (← links)
- An Optimal On-Line Algorithm for <i>K</i> Servers on Trees (Q3204037) (← links)
- (Q3219134) (← links)
- (Q3361888) (← links)
- Optimal Search Trees with 2-Way Comparisons (Q3459851) (← links)
- Improved edge-coloring algorithms for planar graphs (Q3495664) (← links)
- Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems (Q3511421) (← links)
- Oblivious Medians Via Online Bidding (Q3525769) (← links)
- Competitive Analysis of Scheduling Algorithms for Aggregated Links (Q3525795) (← links)
- Polynomial Time Algorithms for Minimum Energy Scheduling (Q3527206) (← links)
- Tile-Packing Tomography Is ${\mathbb{NP}}$ -hard (Q3578325) (← links)
- Caching Is Hard – Even in the Fault Model (Q3586462) (← links)
- Randomized Algorithms for Buffer Management with 2-Bounded Delay (Q3602832) (← links)
- Experimental Analysis of Scheduling Algorithms for Aggregated Links (Q3602845) (← links)
- Algorithms for Placing Monitors in a Flow Network (Q3638447) (← links)
- Three Results on Frequency Assignment in Linear Cellular Networks (Q3638448) (← links)
- (Q3687746) (← links)
- (Q3768406) (← links)
- (Q3773822) (← links)
- (Q3779971) (← links)
- (Q3783597) (← links)
- (Q3806831) (← links)
- Fast algorithms for edge-coloring planar graphs (Q3815319) (← links)
- (Q3824320) (← links)