George Karakostas

From MaRDI portal
Revision as of 05:01, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:428871

Available identifiers

zbMath Open karakostas.georgeMaRDI QIDQ428871

List of research outcomes





PublicationDate of PublicationType
Approximation algorithms for maximum weighted throughput on unrelated machines2025-01-14Paper
Time-sharing scheduling with tolerance capacities2024-12-27Paper
Resource time-sharing for IoT applications with deadlines2023-08-04Paper
Single-item lot-sizing with quantity discount and bounded inventory2022-03-11Paper
Treasure evacuation with one robot on a disk2021-01-25Paper
https://portal.mardi4nfdi.de/entity/Q52268422019-08-01Paper
Search-and-fetch with one robot on a disk (track: wireless and geometry)2018-12-07Paper
Faster approximation schemes for fractional multicommodity flow problems2018-11-05Paper
https://portal.mardi4nfdi.de/entity/Q46359992018-04-23Paper
Know when to persist: deriving value from a stream buffer2018-03-13Paper
Know When to Persist: Deriving Value from a Stream Buffer2016-11-09Paper
Approximation schemes for minimum latency problems2016-09-29Paper
Emergency connectivity in ad-hoc networks with selfish nodes2014-12-02Paper
A better approximation ratio for the vertex cover problem2014-11-18Paper
Social exchange networks with distant bargaining2014-10-06Paper
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates2014-09-09Paper
Using Reputation Instead of Tolls in Repeated Selfish Routing with Incomplete Information2013-10-23Paper
Social Exchange Networks with Distant Bargaining2013-06-11Paper
On derandomization and average-case complexity of monotone functions2012-06-25Paper
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users2010-10-19Paper
Equilibria for networks with malicious users2010-07-21Paper
General Pseudo-random Generators from Weaker Models of Computation2009-12-17Paper
Algorithms and Computation2009-08-07Paper
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates2009-07-23Paper
Stackelberg strategies for selfish routing in general multicommodity networks2009-05-13Paper
Edge pricing of multicommodity networks for selfish users with elastic demands2009-04-29Paper
Maximizing Throughput in Queueing Networks with Limited Flexibility2008-09-18Paper
Maximizing throughput in queueing networks with limited flexibility2008-04-22Paper
Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes2008-04-15Paper
Selfish Routing with Oblivious Users2007-11-15Paper
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands2007-09-10Paper
A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem2006-06-14Paper
Automata, Languages and Programming2006-01-10Paper
Faster approximation schemes for fractional multicommodity flow problems2004-11-29Paper
Approximation Schemes for Minimum Latency Problems2003-09-28Paper
On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q49526962000-05-10Paper

Research outcomes over time

This page was built for person: George Karakostas