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="Kapralov, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Perfect matchings in
O(n\log n)
time in regular bipartite graphs
Ashish Goel
,
Michael Kapralov
,
Sanjeev Khanna
SIAM Journal on Computing
42
(3), 2013, pp. 1392-1404
Embedding paths into trees: VM placement to minimize congestion
Debojyoti Dutta
,
Michael Kapralov
,
Ian Post
,
Rajendra Shinde
Lecture Notes in Computer Science
7501
, 2012, pp. 431-442
NNS lower bounds via metric expansion for
l_\infty
and EMD
Michael Kapralov
,
Rina Panigrahy
Lecture Notes in Computer Science
7391
, 2012, pp. 545-556
Improved bounds for online stochastic matching
Bahman Bahmani
,
Michael Kapralov
Lecture Notes in Computer Science
6346
, 2010, pp. 170-181
Perfect matchings in
O(n\log n)
time in regular bipartite graphs
Ashish Goel
,
Michael Kapralov
,
Sanjeev Khanna
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 39-46