The following pages link to George Karakostas (Q428871):
Displaying 34 items.
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- Emergency connectivity in ad-hoc networks with selfish nodes (Q476427) (← links)
- Social exchange networks with distant bargaining (Q744107) (← links)
- Equilibria for networks with malicious users (Q985313) (← links)
- Edge pricing of multicommodity networks for selfish users with elastic demands (Q1014793) (← links)
- Stackelberg strategies for selfish routing in general multicommodity networks (Q1017909) (← links)
- On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) (Q1401330) (← links)
- Search-and-fetch with one robot on a disk (track: wireless and geometry) (Q1629940) (← links)
- Know when to persist: deriving value from a stream buffer (Q1704857) (← links)
- Treasure evacuation with one robot on a disk (Q2220826) (← links)
- Maximizing throughput in queueing networks with limited flexibility (Q2426560) (← links)
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
- Single-item lot-sizing with quantity discount and bounded inventory (Q2670451) (← links)
- Approximation schemes for minimum latency problems (Q2819598) (← links)
- Know When to Persist: Deriving Value from a Stream Buffer (Q2830062) (← links)
- Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information (Q2856136) (← links)
- A better approximation ratio for the vertex cover problem (Q2930267) (← links)
- On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users (Q3162516) (← links)
- An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates (Q3189083) (← links)
- Maximizing Throughput in Queueing Networks with Limited Flexibility (Q3525776) (← links)
- Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands (Q3591345) (← links)
- General Pseudo-random Generators from Weaker Models of Computation (Q3652295) (← links)
- Approximation Schemes for Minimum Latency Problems (Q4429687) (← links)
- (Q4635999) (← links)
- Faster approximation schemes for fractional multicommodity flow problems (Q4828929) (← links)
- Social Exchange Networks with Distant Bargaining (Q4925223) (← links)
- (Q4952696) (← links)
- Faster approximation schemes for fractional multicommodity flow problems (Q4962706) (← links)
- Algorithms and Computation (Q5191698) (← links)
- (Q5226842) (← links)
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates (Q5323068) (← links)
- Selfish Routing with Oblivious Users (Q5425980) (← links)
- Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes (Q5458542) (← links)
- Automata, Languages and Programming (Q5716851) (← links)
