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="Hurand, Mathilde"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A
\phi
-competitive algorithm for collecting items with increasing weights from a dynamic queue
Marcin Bienkowski
,
Marek Chrobak
,
Christoph Dürr
,
Mathilde Hurand
,
Artur Jeż
,
Łukasz Jeż
,
Grzegorz Stachowiak
Theoretical Computer Science
475
, 2013, pp. 92-102
Collecting weighted items from a dynamic queue
Marcin Bienkowski
,
Marek Chrobak
,
Christoph Dürr
,
Mathilde Hurand
Algorithmica
65
(1), 2013, pp. 60-94
Better bounds for incremental medians
Marek Chrobak
,
Mathilde Hurand
Theoretical Computer Science
412
(7), 2011, pp. 594-601
Finding total unimodularity in optimization problems solved by linear programs
Christoph Dürr
,
Mathilde Hurand
Algorithmica
59
(2), 2011, pp. 256-268
Finding total unimodularity in optimization problems solved by linear programs
Christoph Dürr
,
Mathilde Hurand
Lecture Notes in Computer Science
4168
, 2006, pp. 315-326