The following pages link to Aris Pagourtzis (Q511144):
Displayed 50 items.
- Energy-efficient broadcasting in ad hoc wireless networks (Q511146) (← links)
- Deterministic communication in radio networks with large labels (Q868440) (← links)
- Improved periodic data retrieval in asynchronous rings with a faulty host (Q896144) (← links)
- Satisfying a maximum number of pre-routed requests in all-optical rings. (Q1400411) (← links)
- Routing and path multicoloring (Q1607124) (← links)
- Minimum multiplicity edge coloring via orientation (Q1671364) (← links)
- Reliable communication via semilattice properties of partial knowledge (Q1679991) (← links)
- Path multicoloring in spider graphs with even color multiplicity (Q1705690) (← links)
- A faster FPTAS for the subset-sums ratio problem (Q1791024) (← links)
- On the complexity of the upper \(r\)-tolerant edge cover problem (Q1997258) (← links)
- Approximation schemes for subset sum ratio problems (Q2037971) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Designated-verifier linkable ring signatures (Q2104415) (← links)
- Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
- Approximate \#knapsack computations to count semi-fair allocations (Q2110714) (← links)
- Characterizations and approximability of hard counting classes below \#\textsf{P} (Q2110717) (← links)
- Completeness, approximability and exponential time results for counting problems with easy decision version (Q2143122) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
- Extension and its price for the Connected Vertex Cover problem (Q2301752) (← links)
- Reliable broadcast with respect to topology knowledge (Q2407628) (← links)
- On the connection between interval size functions and path counting (Q2410681) (← links)
- Path multicoloring with fewer colors in spiders and caterpillars (Q2460919) (← links)
- Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost (Q2575919) (← links)
- The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design (Q2842783) (← links)
- Periodic Metro Scheduling (Q2917403) (← links)
- The Byzantine Generals Problem in Generic and Wireless Networks (Q2926152) (← links)
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126) (← links)
- An experimental study of maximum profit wavelength assignment in WDM rings (Q3008923) (← links)
- (Q3181697) (← links)
- The Lazy Matroid Problem (Q3190151) (← links)
- Randomized and Approximation Algorithms for Blue-Red Matching (Q3525614) (← links)
- On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks (Q3596715) (← links)
- On the Connection between Interval Size Functions and Path Counting (Q3630195) (← links)
- (Q4411387) (← links)
- (Q4412042) (← links)
- (Q4415064) (← links)
- Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique (Q4432861) (← links)
- (Q4474107) (← links)
- (Q4787343) (← links)
- Selfish Resource Allocation in Optical Networks (Q4924635) (← links)
- (Q4953368) (← links)
- (Q4999211) (← links)
- (Q5005184) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
- Algorithms and Computation (Q5191690) (← links)
- Completeness Results for Counting Problems with Easy Decision (Q5283355) (← links)
- Stathis Zachos at 70! (Q5283390) (← links)
- Brief Announcement (Q5361936) (← links)
- Distributed Routing in Tree Networks with Few Landmarks (Q5385932) (← links)