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
[2]
Hilfe
Suche: Author="Konjevod, Goran"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Effective storage capacity of labeled graphs
Dana Angluin
,
James Aspnes
,
Rida A. Bazzi
,
Jiang Chen
,
David Eisenstat
,
Goran Konjevod
Information and Computation
234
, 2014, pp. 44-56
Folding a better checkerboard
Erik D. Demaine
,
Martin L. Demaine
,
Goran Konjevod
,
Robert J. Lang
Lecture Notes in Computer Science
5878
, 2009, pp. 1074-1083
Coloring number and on-line Ramsey theory for graphs and hypergraphs
H.A. Kierstead
,
Goran Konjevod
Combinatorica
29
(1), 2009, pp. 49-64
Improved approximations for tour and tree covers
Jochen Könemann
,
Goran Konjevod
,
Ojas Parekh
,
Amitabh Sinha
Algorithmica
38
(3), 2004, pp. 441-449
Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the TRANSIMS router
Chris Barrett
,
Keith Bisset
,
Riko Jacob
,
Goran Konjevod
,
Madhav Marathe
Lecture Notes in Computer Science
2461
, 2002, pp. 126-138
On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem
Naveen Garg
,
Rohit Khandekar
,
Goran Konjevod
,
R. Ravi
,
F.S. Salman
,
Amitabh Sinha
Lecture Notes in Computer Science
2081
, 2001, pp. 170-184
On approximating planar metrics by tree metrics
Goran Konjevod
,
R. Ravi
,
F. Sibel Salman
Information Processing Letters
80
(4), 2001, pp. 213-219
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Avrim Blum
,
Goran Konjevod
,
R. Ravi
,
Santosh Vempala
Theoretical Computer Science
235
(1), 2000, pp. 25-42
A
2\frac{1}{10}
-approximation algorithm for a generalization of the weighted edge-dominating set problem
Robert Carr
,
Toshihiro Fujito
,
Goran Konjevod
,
Ojas Parekh
Lecture Notes in Computer Science
1879
, 2000, pp. 132-142
A polylogarithmic approximation algorithm for the group Steiner tree problem
Naveen Garg
,
Goran Konjevod
,
R. Ravi
Journal of Algorithms
37
(1), 2000, pp. 66-84
Budget constrained minimum cost connected medians
Goran Konjevod
,
Sven O. Krumke
,
Madhav Marathe
Lecture Notes in Computer Science
1928
, 2000, pp. 267-278
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Avrim Blum
,
Goran Konjevod
,
R. Ravi
,
Santosh Vempala
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 100-105
A polylogarithmic approximation algorithm for the group Steiner tree problem
Naveen Garg
,
Goran Konjevod
,
R. Ravi
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 253-259