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
[1]
Hilfe
Suche: Author="Kaplan, Haim"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimum cost flows in graphs with unit capacities
Andrew V. Goldberg
,
Haim Kaplan
,
Sagi Hed
,
Robert E. Tarjan
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 406-419
Computing the discrete Fréchet distance in subquadratic time
Pankaj K. Agarwal
,
Rinat Ben Avraham
,
Haim Kaplan
,
Micha Sharir
SIAM Journal on Computing
43
(2), 2014, pp. 429-449
Reporting neighbors in high-dimensional Euclidean space
Dror Aiger
,
Haim Kaplan
,
Micha Sharir
SIAM Journal on Computing
43
(4), 2014, pp. 1363-1395
Algorithms and estimators for summarization of unaggregated data streams
Edith Cohen
,
Nick Duffield
,
Haim Kaplan
,
Carstent Lund
,
Mikkel Thorup
Journal of Computer and System Sciences
80
(7), 2014, pp. 1214-1244
Union of random Minkowski sums and network vulnerability analysis
Pankaj K. Agarwal
,
Haim Kaplan
,
Micha Sharir
Proceedings of the 29th Annual ACM Symposium on Computional Geometry, SoCG'2013 (Rio de Janeiro, Brazil, June 17-20, 2013)
, 2013, pp. 177-186
Minimal indices for successor search
Sarel Cohen
,
Amos Fiat
,
Moshik Hershcovitch
,
Haim Kaplan
Lecture Notes in Computer Science
8087
, 2013, pp. 278-289
Joint cache partition and job assignment on multi-core processors
Avinatan Hassidim
,
Haim Kaplan
,
Omry Tuval
Lecture Notes in Computer Science
8037
, 2013, pp. 378-389
I/O efficient dynamic data structures for longest prefix queries
Moshe Hershcovitch
,
Haim Kaplan
Algorithmica
65
(2), 2013, pp. 371-390
Soft heaps simplified
Haim Kaplan
,
Robert E. Tarjan
,
Uri Zwick
SIAM Journal on Computing
42
(4), 2013, pp. 1660-1673
An optimal dynamic data structure for stabbing-semigroup queries
Pankaj K. Agarwal
,
Lars Arge
,
Haim Kaplan
,
Eyal Molad
,
Robert Robert E. Tarjan
,
Ke Yi
SIAM Journal on Computing
41
(1), 2012, pp. 104-127
Envy-free makespan approximation
Edith Cohen
,
Michal Feldman
,
Amos Fiat
,
Haim Kaplan
,
Svetlana Olonetsky
SIAM Journal on Computing
41
(1), 2012, pp. 12-25
Finding the maximal empty disk containing a query point
Haim Kaplan
,
Micha Sharir
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 287-292
Improved bounds for geometric permutations
Natan Rubin
,
Haim Kaplan
,
Micha Sharir
SIAM Journal on Computing
41
(2), 2012, pp. 367-390
Efficient stream sampling for variance-optimal estimation of subset sums
Edith Cohen
,
Nick Duffield
,
Haim Kaplan
,
Carsten Lund
,
Mikkel Thorup
SIAM Journal on Computing
40
(5), 2011, pp. 1402-1431
On lines, joints, and incidences in three dimensions
György Elekes
,
Haim Kaplan
,
Micha Sharir
Journal of Combinatorial Theory Series A
118
(3), 2011, pp. 962-977
Maximum flows by incremental breadth-first search
Andrew V. Goldberg
,
Sagi Hed
,
Haim Kaplan
,
Robert E. Tarjan
,
Renato F. Werneck
Lecture Notes in Computer Science
6942
, 2011, pp. 457-468
Optimal cover of points by disks in a simple polygon
Haim Kaplan
,
Matthew J. Katz
,
Gila Morgenstern
,
Micha Sharir
SIAM Journal on Computing
40
(6), 2011, pp. 1647-1661
Maximum flow in directed planar graphs with vertex capacities
Haim Kaplan
,
Yahav Nussbaum
Algorithmica
61
(1), 2011, pp. 174-189
A simpler linear-time recognition of circular-arc graphs
Haim Kaplan
,
Yahav Nussbaum
Algorithmica
61
(3), 2011, pp. 694-737
Minimum
s-t
cut in undirected planar graphs when the source and the sink are close
Haim Kaplan
,
Yahav Nussbaum
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 117-128
The MST of symmetric disk graphs is light
A. Karim Abu-Affash
,
Rom Aschner
,
Paz Carmi
,
Matthew J. Katz
Lecture Notes in Computer Science
6139
, 2010, pp. 236-247
Bregman clustering for separable instances
Marcel R. Ackermann
,
Johannes Blömer
Lecture Notes in Computer Science
6139
, 2010, pp. 212-223
Faster parameterized algorithms for minor containment
Isolde Adler
,
Frederic Dorn
,
Fedor V. Fomin
,
Ignasi Sau
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
6139
, 2010, pp. 322-333
Guarding a terrain by two watchtowers
Pankaj K. Agarwal
,
Sergey Bereg
,
Ovidiu Daescu
,
Haim Kaplan
,
Simeon Ntafos
,
Micha Sharir
,
Binhai Zhu
Algorithmica
58
(2), 2010, pp. 352-390
Semidefinite programming and approximation algorithms: A survey
Sanjeev Arora
Lecture Notes in Computer Science
6139
, 2010, pp. 25-25
Seiten 1
2
3
4
5
6
>