The following pages link to Christine Markarian (Q346512):
Displaying 16 items.
- Towards the price of leasing online (Q346515) (← links)
- An optimal algorithm for Online Prize-Collecting Node-Weighted Steiner Forest (Q1671004) (← links)
- Price fluctuation in online leasing (Q1708591) (← links)
- Towards flexible demands in online leasing problems (Q1750358) (← links)
- A distributed approximation algorithm for strongly connected dominating-absorbent sets in asymmetric wireless ad-hoc networks (Q1796438) (← links)
- A continuous strategy for collisionless gathering (Q2220827) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692) (← links)
- The Monotone Circuit Value Problem with Bounded Genus Is in NC (Q2817851) (← links)
- Randomized Online Algorithms for Set Cover Leasing Problems (Q2942379) (← links)
- On the Parameterized Parallel Complexity and the Vertex Cover Problem (Q2958339) (← links)
- Towards Flexible Demands in Online Leasing Problems (Q3196390) (← links)
- (Q3301010) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
- Leasing with Uncertainty (Q4685787) (← links)
- A Continuous Strategy for Collisionless Gathering (Q5056062) (← links)
