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="Agnarsson, Geir"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
SDP-based algorithms for maximum independent set problems on hypergraphs
Geir Agnarsson
,
Magnús M. Halldórsson
,
Elena Losievskaja
Theoretical Computer Science
470
, 2013, pp. 1-9
A note on the maximum number of edges of nonflowerable coin graphs
Geir Agnarsson
,
Jill Bigley Dunham
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1714-1721
SDP-based algorithms for maximum independent set problems on hypergraphs
Geir Agnarsson
,
Magnús M. Halldórsson
,
Elena Losievskaja
Lecture Notes in Computer Science
5555
, 2009, pp. 12-23
Strong colorings of hypergraphs
Geir Agnarsson
,
Magnús M. Halldórsson
Lecture Notes in Computer Science
3351
, 2005, pp. 253-266
Coloring powers of planar graphs
Geir Agnarsson
,
Magnús M. Halldórsson
SIAM Journal on Discrete Mathematics
16
(4), 2003, pp. 651-662
Powers of geometric intersection graphs and dispersion algorithms
Geir Agnarsson
,
Peter Damaschke
,
Magnús M. Halldórsson
Lecture Notes in Computer Science
2368
, 2002, pp. 140-149