Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Hajiaghayi, Mohammadtaghi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Correction: Basic network creation games
Noga Alon
,
Erik D. Demaine
,
Mohammadtaghi Hajiaghayi
,
Panagiotis Kanellopoulos
,
Tom Leighton
SIAM Journal on Discrete Mathematics
28
(3), 2014, pp. 1638-1640
Online stochastic reordering buffer scheduling
Hossein Esfandiari
,
MohammadTaghi Hajiaghayi
,
Mohammad Reza Khani
,
Vahid Liaghat
,
Hamid Mahini
,
Harald Räcke
Lecture Notes in Computer Science
8572
, 2014, pp. 465-476
Near-optimal online algorithms for prize-collecting Steiner problems
MohammadTaghi Hajiaghayi
,
Vahid Liaghat
,
Debmalya Panigrahi
Lecture Notes in Computer Science
8572
, 2014, pp. 576-587
Improved approximation algorithms for (budgeted) node-weighted Steiner problems
MohammadHossein Bateni
,
MohammadTaghi Hajiaghayi
,
Vahid Liaghat
Lecture Notes in Computer Science
7965
, 2013, pp. 81-92
A game-theoretic model motivated by the DARPA Network Challenge
Rajesh Chitnis
,
MohammadTaghi Hajiaghayi
,
Jonathan Katz
,
Koyel Mukherjee
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013)
, 2013, pp. 115-118
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Rajesh Chitnis
,
Mohammadtaghi Hajiaghayi
,
Dániel Marx
SIAM Journal on Computing
42
(4), 2013, pp. 1674-1696
Euclidean prize-collecting Steiner forest
MohammadHossein Bateni
,
MohammadTaghi Hajiaghayi
Algorithmica
62
(3-4), 2012, pp. 906-929
Directed subset feedback vertex set is fixed-parameter tractable
Rajesh Chitnis
,
Marek Cygan
,
Mohammadtaghi Hajiaghayi
,
Dániel Marx
Lecture Notes in Computer Science
7391
, 2012, pp. 230-241
The checkpoint problem
MohammadTaghi Hajiaghayi
,
Rohit Khandekar
,
Guy Kortsarz
,
Julián Mestre
Theoretical Computer Science
452
, 2012, pp. 88-99
Improved approximation algorithms for prize-collecting Steiner tree and TSP
Aaron Archer
,
MohammadHossein Bateni
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
SIAM Journal on Computing
40
(2), 2011, pp. 309-332
Scheduling to minimize staleness and stretch in real-time data warehouses
MohammadHossein Bateni
,
Lukasz Golab
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
Theory of Computing Systems
49
(4), 2011, pp. 757-780
Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
Mohammadhossein Bateni
,
Mohammadtaghi Hajiaghayi
,
Dániel Marx
Journal of the ACM
58
(5), 2011, pp. 21: 1-37
Improved approximation algorithms for label cover problems
Moses Charikar
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
Algorithmica
61
(1), 2011, pp. 190-206
Contraction decomposition in
H
-minor-free graphs and algorithmic applications
Erik D. Demaine
,
MohammadTaghi Hajiaghayi
,
Ken-ichi Kawarabayashi
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 441-450
On a local protocol for concurrent file transfers
MohammadTaghi Hajiaghayi
,
Rohit Khandekar
,
Guy Kortsarz
,
Vahid Liaghat
Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011)
, 2011, pp. 269-278
Basic network creation games
Noga Alon
,
Erik D. Demaine
,
MohammadTaghi Hajiaghayi
,
Tom Leighton
Proceedings of the 22nd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2010 (Thira, Santorini, Greece, June 13-15, 2010)
, 2010, pp. 106-113
The cooperative game theory foundations of network bargaining games
MohammadHossein Bateni
,
MohammadTaghi Hajiaghayi
,
Nicole Immorlica
,
Hamid Mahini
Lecture Notes in Computer Science
6198
, 2010, pp. 67-78
Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
MohammadHossein Bateni
,
MohammadTaghi Hajiaghayi
,
Dániel Marx
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 211-220
Euclidean prize-collecting Steiner forest
MohammadHossein Bateni
,
MohammadTaghi Hajiaghayi
Lecture Notes in Computer Science
6034
, 2010, pp. 503-514
Approximation algorithms via contraction decomposition
Erik D. Demaine
,
MohammadTaghi Hajiaghayi
,
Bojan Mohar
Combinatorica
30
(5), 2010, pp. 533-552
Prize-collecting Steiner network problems
MohammadTaghi Hajiaghayi
,
Rohit Khandekar
,
Guy Kortsarz
,
Zeev Nutov
Lecture Notes in Computer Science
6080
, 2010, pp. 71-84
Budgeted red-blue median and its generalizations
MohammadTaghi Hajiaghayi
,
Rohit Khandekar
,
Guy Kortsarz
Lecture Notes in Computer Science
6346
, 2010, pp. 314-325
Prize-collecting Steiner networks via iterative rounding
MohammadTaghi Hajiaghayi
,
Arefeh A. Nasri
Lecture Notes in Computer Science
6034
, 2010, pp. 515-526
Scheduling to minimize staleness and stretch in real-time data warehouses
Mohammad Hossein Bateni
,
Lukasz Golab
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2009 (Calgary, Alberta, Canada, August 11-13, 2009)
, 2009, pp. 29-38
Improved approximation algorithms for label cover problems
Moses Charikar
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
Lecture Notes in Computer Science
5757
, 2009, pp. 23-34
Seiten 1
2
3
>