The following pages link to Gruia Călinescu (Q247838):
Displaying 50 items.
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
- (Q390106) (redirect page) (← links)
- Sequential dependency computation via geometric data structures (Q390107) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Register loading via linear programming (Q494793) (← links)
- A note on data structures for maintaining bipartitions (Q924550) (← links)
- A new approximation algorithm for finding heavy planar subgraphs (Q1400892) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1605303) (← links)
- Traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1810863) (← links)
- Minimum-energy broadcasting in static ad hoc wireless networks (Q1859470) (← links)
- Faster compression of patterns to rectangle rule lists (Q2182652) (← links)
- Relay placement for two-connectivity (Q2339829) (← links)
- On ring grooming in optical networks (Q2385478) (← links)
- Client assignment problems for latency minimization (Q2424655) (← links)
- Maximum series-parallel subgraph (Q2429333) (← links)
- Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
- A fast localized algorithm for scheduling sensors (Q2497719) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- (Q2741506) (← links)
- (Q2768266) (← links)
- Approximate Min-Power Strong Connectivity (Q2870520) (← links)
- (Q2934701) (← links)
- Disjoint bases in a polymatroid (Q3055784) (← links)
- An improved approximation algorithm for resource allocation (Q3189033) (← links)
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint (Q3225171) (← links)
- SEPARATING POINTS BY AXIS-PARALLEL LINES (Q3373055) (← links)
- (Q3575437) (← links)
- Min-Power Strong Connectivity (Q3588400) (← links)
- (Q3840353) (← links)
- A Better Approximation Algorithm for Finding Planar Subgraphs (Q4216139) (← links)
- Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (Q4458884) (← links)
- Alphabet-Independent and Scaled Dictionary Matching (Q4500857) (← links)
- (Q4542519) (← links)
- T-joins in strongly connected hypergraphs (Q4597952) (← links)
- Approximation Algorithms for the 0-Extension Problem (Q4651539) (← links)
- (Q4737541) (← links)
- (Q4875164) (← links)
- Register Loading via Linear Programming (Q5199240) (← links)
- (Q5290259) (← links)
- Fast edge colorings with fixed number of colors to minimize imbalance (Q5301445) (← links)
- Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance (Q5385978) (← links)
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Q5429267) (← links)
- Algorithms and Computation (Q5712113) (← links)
- Algorithms and Computation (Q5712114) (← links)
- Maximum Series-Parallel Subgraph (Q5851093) (← links)
- Algorithms - ESA 2003 (Q5897239) (← links)
- Reconfigurations in Graphs and Grids (Q5900354) (← links)
- Reconfigurations in Graphs and Grids (Q5901488) (← links)
