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="Kenyon-Mathieu, Claire"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On hierarchical diameter-clustering and the supplier problem
Aparna Das
,
Claire Kenyon-Mathieu
Theory of Computing Systems
45
(3), 2009, pp. 497-511
Commitment under uncertainty: Two-stage stochastic matching problems
Irit Katriel
,
Claire Kenyon-Mathieu
,
Eli Upfal
Theoretical Computer Science
408
(2-3), 2008, pp. 213-223
Commitment under uncertainty: Two-stage stochastic matching problems
Irit Katriel
,
Claire Kenyon-Mathieu
,
Eli Upfal
Lecture Notes in Computer Science
4596
, 2007, pp. 171-182
How to rank with few errors - A PTAS for weighted feedback arc set on tournaments
Claire Kenyon-Mathieu
,
Warren Schudy
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 95-103
The maximum size of dynamic data structures
Claire M. Kenyon-Mathieu
,
Jeffrey Scott Vitter
SIAM Journal on Computing
20
(5), 1991, October, pp. 807-823
Verifying partial orders
Claire Kenyon-Mathieu
,
Valerie King
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC'89 (Seattle, Washington, May 15-17, 1989)
, 1989, pp. 367-374