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="Michail, Dimitrios"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fair matchings and related problems
Chien-Chung Huang
,
Telikepalli Kavitha
,
Kurt Mehlhorn
,
Dimitrios Michail
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 339-350
Bounded unpopularity matchings
Chien-Chung Huang
,
Telikepalli Kavitha
,
Dimitrios Michail
,
Meghana Nasre
Algorithmica
61
(3), 2011, pp. 738-757
New approximation algorithms for minimum cycle bases of graphs
Telikepalli Kavitha
,
Kurt Mehlhorn
,
Dimitrios Michail
Algorithmica
59
(4), 2011, pp. 471-488
Bounded unpopularity matchings
Chien-Chung Huang
,
Telikepalli Kavitha
,
Dimitrios Michail
,
Meghana Nasre
Lecture Notes in Computer Science
5124
, 2008, pp. 127-137
An
{\~O}(m^2n)
algorithm for minimum cycle basis of graphs
Telikepalli Kavitha
,
Kurt Mehlhorn
,
Dimitrios Michail
,
Katarzyna E. Paluch
Algorithmica
52
(3), 2008, pp. 333-349
New approximation algorithms for minimum cycle bases of graphs
Telikepalli Kavitha
,
Kurt Mehlhorn
,
Dimitrios Michail
Lecture Notes in Computer Science
4393
, 2007, pp. 512-523
Reducing rank-maximal to maximum weight matching
Dimitrios Michail
Theoretical Computer Science
389
(1-2), 2007, pp. 125-132
Strongly stable matchings in time
O(nm)
and extension to the hospitals-residents problem
Telikepalli Kavitha
,
Kurt Mehlhorn
,
Dimitrios Michail
,
Katarzyna Paluch
Lecture Notes in Computer Science
2996
, 2004, pp. 222-233
A faster algorithm for minimum cycle basis of graphs
Telikepalli Kavitha
,
Kurt Mehlhorn
,
Dimitrios Michail
,
Katarzyna Paluch
Lecture Notes in Computer Science
3142
, 2004, pp. 846-857