The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Tobias Harks" ( http://dblp.L3S.de/Authors/Tobias_Harks )

  Author page on DBLP  Author page in RDF  Community of Tobias Harks in ASPL-2

Publication years (Num. hits)
2005-2009 (16) 2010-2012 (12)
Publication types (Num. hits)
article(9) inproceedings(19)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords

Results
Found 28 publication records. Showing 28 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Tobias Harks, Britta Peis Resource Buying Games Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Tobias Harks Stackelberg Strategies and Collusion in Network Games with Splittable Flow. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Max Klimm, Rolf H. Möhring Characterizing the Existence of Potential Functions in Weighted Congestion Games. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Max Klimm Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces. Search on Bibsonomy WINE The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Philipp von Falkenhausen, Tobias Harks Optimal cost sharing protocols for scheduling games. Search on Bibsonomy ACM Conference on Electronic Commerce The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller Optimal File Distribution in Peer-to-Peer Networks. Search on Bibsonomy ISAAC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Max Klimm Congestion games with variable demands. Search on Bibsonomy TARK The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vincenzo Bonifaci, Tobias Harks, Guido Schäfer Stackelberg Routing in Arbitrary Networks. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Max Klimm Congestion Games with Variable Demands Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games. Search on Bibsonomy ESA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Max Klimm On the Existence of Pure Nash Equilibria in Weighted Congestion Games. Search on Bibsonomy ICALP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Andre Berger, James Gross, Tobias Harks The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks. Search on Bibsonomy INFOCOM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Max Klimm, Rolf H. Möhring Strong Nash Equilibria in Games with the Lexicographical Improvement Property Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Tobias Harks, Stefan Heinz, Marc E. Pfetsch Competitive Online Multicommodity Routing. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Online network optimization, Multicommodity routing, Competitive analysis, Unsplittable flow
1Tobias Harks, Max Klimm, Rolf H. Möhring Strong Nash Equilibria in Games with the Lexicographical Improvement Property. Search on Bibsonomy WINE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Max Klimm, Rolf H. Möhring Characterizing the Existence of Potential Functions in Weighted Congestion Games. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ariffin Datuk Yahaya, Tobias Harks, Tatsuya Suda iREX: efficient automation architecture for the deployment of inter-domain QoS policy. Search on Bibsonomy IEEE Transactions on Network and Service Management The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Tobias Poschwatta Congestion control in utility fair networks. Search on Bibsonomy Computer Networks The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Vincenzo Bonifaci, Tobias Harks, Guido Schäfer Stackelberg Routing in Arbitrary Networks. Search on Bibsonomy WINE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Konstantin Miller, Tobias Harks Utility Max-Min Fair Congestion Control with Time-Varying Delays. Search on Bibsonomy INFOCOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tobias Harks Stackelberg Strategies and Collusion in Network Games with Splittable Flow. Search on Bibsonomy WAOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tobias Harks, László A. Végh Nonadaptive Selfish Routing with Online Demands. Search on Bibsonomy CAAN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Tobias Poschwatta Utility Fair Congestion Control for Real-Time Traffic. Search on Bibsonomy INFOCOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Ariffin Datuk Yahaya, Tobias Harks, Tatsuya Suda iREX: Efficient Inter-Domain QoS Policy Architecture. Search on Bibsonomy GLOBECOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Stefan Heinz, Marc E. Pfetsch Competitive Online Multicommodity Routing. Search on Bibsonomy WAOA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Tobias Harks Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach. Search on Bibsonomy QoS-IP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Tobias Poschwatta Priority Pricing in Utility Fair Networks. Search on Bibsonomy ICNP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Tobias Poschwatta Utility fair congestion control for real-time traffic. Search on Bibsonomy INFOCOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #28 of 28 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.