Geir Agnarsson

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
j12		Geir Agnarsson: Induced subgraphs of hypercubes. Eur. J. Comb. 34(2): 155-168 (2013)
j11		Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja: SDP-based algorithms for maximum independent set problems on hypergraphs. Theor. Comput. Sci. 470: 1-9 (2013)
	2011
j10		Geir Agnarsson, Jill Bigley Dunham: A Note on the Maximum Number of Edges of Nonflowerable Coin Graphs. SIAM J. Discrete Math. 25(4): 1714-1721 (2011)
	2010
j9		Geir Agnarsson, Magnús M. Halldórsson: Vertex coloring the square of outerplanar graphs of low degree. Discussiones Mathematicae Graph Theory 30(4): 619-636 (2010)
	2009
c7		Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja: SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs. ICALP (1) 2009: 12-23
	2008
j8		Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson: Vertex coloring acyclic digraphs and their corresponding hypergraphs. Discrete Applied Mathematics 156(10): 1918-1928 (2008)
j7		Geir Agnarsson: On multipartite posets. Discrete Mathematics 308(22): 5284-5288 (2008)
c6		Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra: The Complexity of the Evolution of Graph Labelings. SNPD 2008: 79-84
	2007
j6		Geir Agnarsson, Magnús M. Halldórsson: Strongly simplicial vertices of powers of trees. Discrete Mathematics 307(21): 2647-2652 (2007)
	2006
j5		Geir Agnarsson, Li Chen: On the extension of vertex maps to graph homomorphisms. Discrete Mathematics 306(17): 2021-2030 (2006)
	2004
c5		Geir Agnarsson, Magnús M. Halldórsson: On colorings of squares of outerplanar graphs. SODA 2004: 244-253
c4		Geir Agnarsson, Magnús M. Halldórsson: Strong Colorings of Hypergraphs. WAOA 2004: 253-266
	2003
j4		Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson: Powers of geometric intersection graphs and dispersion algorithms. Discrete Applied Mathematics 132(1-3): 3-16 (2003)
j3		Geir Agnarsson, Magnús M. Halldórsson: Coloring Powers of Planar Graphs. SIAM J. Discrete Math. 16(4): 651-662 (2003)
c3		Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson: Proper Down-Coloring Simple Acyclic Digraphs. AGTIVE 2003: 299-312
	2002
c2		Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson: Powers of Geometric Intersection Graphs and Dispersion Algorithms. SWAT 2002: 140-149
	2001
j2		Geir Agnarsson, Benjamin Doerr, Tomasz Schoen: Coloring t-dimensional m-Boxes. Discrete Mathematics 226(1-3): 21-33 (2001)
	2000
c1		Geir Agnarsson, Magnús M. Halldórsson: Coloring powers of planar graphs. SODA 2000: 654-662
	1999
j1		Geir Agnarsson, Stefan Felsner, William T. Trotter: The maximum number of edges in a graph of bounded dimension, with applications to ring theory. Discrete Mathematics 201(1-3): 5-19 (1999)

Coauthor Index

1	Li Chen	[j5]
2	Peter Damaschke	[j4] [c2]
3	Benjamin Doerr	[j2]
4	Jill Bigley Dunham	[j10]
5	Ágúst S. Egilsson	[j8] [c3]
6	Stefan Felsner	[j1]
7	Raymond Greenlaw	[c6]
8	Magnús M. Halldórsson	[j11] [j9] [c7] [j8] [j6] [c5] [c4] [j4] [j3] [c3] [c2] [c1]
9	Sanpawat Kantabutra	[c6]
10	Elena Losievskaja	[j11] [c7]
11	Tomasz Schoen	[j2]
12	William T. Trotter	[j1]

Colors in the list of coauthors

Last update Fri May 24 17:49:51 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page