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="Katriel, Irit"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Simultaneous matchings: Hardness and approximation
Martin Kutz
,
Khaled Elbassioni
,
Irit Katriel
,
Meena Mahajan
Journal of Computer and System Sciences
74
(5), 2008, pp. 884-897
Dynamic matchings in convex bipartite graphs
Gerth Stlting Brodal
,
Loukas Georgiadis
,
Kristoffer Arnsfelt Hansen
,
Irit Katriel
Lecture Notes in Computer Science
4708
, 2007, pp. 406-417
Canonical density control
Alon Itai
,
Irit Katriel
Information Processing Letters
104
(6), 2007, pp. 200-204
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
Faster algorithms for computing longest common increasing subsequences
Gerth Stlting Brodal
,
Kanela Kaligosi
,
Irit Katriel
,
Martin Kutz
Lecture Notes in Computer Science
4009
, 2006, pp. 330-341
Simultaneous matchings
Khaled Elbassioni
,
Irit Katriel
,
Martin Kutz
,
Meena Mahajan
Lecture Notes in Computer Science
3827
, 2005, pp. 106-115
On the algebraic complexity of set equality and inclusion
Irit Katriel
Information Processing Letters
92
(4), 2004, pp. 175-178
Elementary graph algorithms in external memory
Irit Katriel
,
Ulrich Meyer
Lecture Notes in Computer Science
2625
, 2003, pp. 62-84
A practical minimum spanning tree algorithm using the cycle property
Irit Katriel
,
Peter Sanders
,
Jesper Larsson Träff
Lecture Notes in Computer Science
2832
, 2003, pp. 679-690