BibTeX records: Geir Agnarsson

download as .bib file

@article{DBLP:journals/order/AgnarssonE20,
  author       = {Geir Agnarsson and
                  Neil Epstein},
  title        = {On Monomial Ideals and Their Socles},
  journal      = {Order},
  volume       = {37},
  number       = {2},
  pages        = {341--369},
  year         = {2020},
  url          = {https://doi.org/10.1007/s11083-019-09509-z},
  doi          = {10.1007/S11083-019-09509-Z},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/order/AgnarssonE20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Agnarsson17,
  author       = {Geir Agnarsson},
  title        = {On a Special Class of Hyper-Permutahedra},
  journal      = {Electron. J. Comb.},
  volume       = {24},
  number       = {3},
  pages        = {3},
  year         = {2017},
  url          = {https://doi.org/10.37236/6652},
  doi          = {10.37236/6652},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/Agnarsson17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/AgnarssonGK16,
  author       = {Geir Agnarsson and
                  Raymond Greenlaw and
                  Sanpawat Kantabutra},
  title        = {On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem},
  journal      = {Acta Cybern.},
  volume       = {22},
  number       = {3},
  pages        = {591--612},
  year         = {2016},
  url          = {https://doi.org/10.14232/actacyb.22.3.2016.3},
  doi          = {10.14232/ACTACYB.22.3.2016.3},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/actaC/AgnarssonGK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/AgnarssonGK16a,
  author       = {Geir Agnarsson and
                  Raymond Greenlaw and
                  Sanpawat Kantabutra},
  title        = {The Structure of Rooted Weighted Trees Modeling Layered Cyber-security
                  Systems},
  journal      = {Acta Cybern.},
  volume       = {22},
  number       = {4},
  pages        = {735--769},
  year         = {2016},
  url          = {https://doi.org/10.14232/actacyb.22.4.2016.2},
  doi          = {10.14232/ACTACYB.22.4.2016.2},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/actaC/AgnarssonGK16a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AgnarssonGK16,
  author       = {Geir Agnarsson and
                  Raymond Greenlaw and
                  Sanpawat Kantabutra},
  title        = {The structure and topology of rooted weighted trees modeling layered
                  cyber-security systems},
  journal      = {CoRR},
  volume       = {abs/1605.03569},
  year         = {2016},
  url          = {http://arxiv.org/abs/1605.03569},
  eprinttype    = {arXiv},
  eprint       = {1605.03569},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AgnarssonGK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AgnarssonGK15,
  author       = {Geir Agnarsson and
                  Raymond Greenlaw and
                  Sanpawat Kantabutra},
  title        = {The complexity of cyber attacks in a new layered-security model and
                  the maximum-weight, rooted-subtree problem},
  journal      = {CoRR},
  volume       = {abs/1508.03657},
  year         = {2015},
  url          = {http://arxiv.org/abs/1508.03657},
  eprinttype    = {arXiv},
  eprint       = {1508.03657},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AgnarssonGK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Agnarsson13,
  author       = {Geir Agnarsson},
  title        = {On the number of hypercubic bipartitions of an integer},
  journal      = {Discret. Math.},
  volume       = {313},
  number       = {24},
  pages        = {2857--2864},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.disc.2013.08.033},
  doi          = {10.1016/J.DISC.2013.08.033},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Agnarsson13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Agnarsson13,
  author       = {Geir Agnarsson},
  title        = {Induced subgraphs of hypercubes},
  journal      = {Eur. J. Comb.},
  volume       = {34},
  number       = {2},
  pages        = {155--168},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ejc.2012.09.004},
  doi          = {10.1016/J.EJC.2012.09.004},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/Agnarsson13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AgnarssonHL13,
  author       = {Geir Agnarsson and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Elena Losievskaja},
  title        = {SDP-based algorithms for maximum independent set problems on hypergraphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {470},
  pages        = {1--9},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.11.025},
  doi          = {10.1016/J.TCS.2012.11.025},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AgnarssonHL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AgnarssonD11,
  author       = {Geir Agnarsson and
                  Jill Bigley Dunham},
  title        = {A Note on the Maximum Number of Edges of Nonflowerable Coin Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {25},
  number       = {4},
  pages        = {1714--1721},
  year         = {2011},
  url          = {https://doi.org/10.1137/100796078},
  doi          = {10.1137/100796078},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/AgnarssonD11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/AgnarssonH10,
  author       = {Geir Agnarsson and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {Vertex coloring the square of outerplanar graphs of low degree},
  journal      = {Discuss. Math. Graph Theory},
  volume       = {30},
  number       = {4},
  pages        = {619--636},
  year         = {2010},
  url          = {https://doi.org/10.7151/dmgt.1518},
  doi          = {10.7151/DMGT.1518},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dmgt/AgnarssonH10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AgnarssonHL09,
  author       = {Geir Agnarsson and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Elena Losievskaja},
  editor       = {Susanne Albers and
                  Alberto Marchetti{-}Spaccamela and
                  Yossi Matias and
                  Sotiris E. Nikoletseas and
                  Wolfgang Thomas},
  title        = {SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs},
  booktitle    = {Automata, Languages and Programming, 36th International Colloquium,
                  {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {5555},
  pages        = {12--23},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02927-1\_3},
  doi          = {10.1007/978-3-642-02927-1\_3},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/AgnarssonHL09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AgnarssonEH08,
  author       = {Geir Agnarsson and
                  {\'{A}}g{\'{u}}st S. Egilsson and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {Vertex coloring acyclic digraphs and their corresponding hypergraphs},
  journal      = {Discret. Appl. Math.},
  volume       = {156},
  number       = {10},
  pages        = {1918--1928},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.dam.2007.07.022},
  doi          = {10.1016/J.DAM.2007.07.022},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AgnarssonEH08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Agnarsson08,
  author       = {Geir Agnarsson},
  title        = {On multipartite posets},
  journal      = {Discret. Math.},
  volume       = {308},
  number       = {22},
  pages        = {5284--5288},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.disc.2007.09.001},
  doi          = {10.1016/J.DISC.2007.09.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Agnarsson08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/snpd/AgnarssonGK08,
  author       = {Geir Agnarsson and
                  Raymond Greenlaw and
                  Sanpawat Kantabutra},
  title        = {The Complexity of the Evolution of Graph Labelings},
  booktitle    = {Ninth {ACIS} International Conference on Software Engineering, Artificial
                  Intelligence, Networking and Parallel/Distributed Computing, {SNPD}
                  2008, In conjunction with Second International Workshop on Advanced
                  Internet Technology and Applications, August 6-8, 2008, Phuket, Thailand},
  pages        = {79--84},
  publisher    = {{IEEE} Computer Society},
  year         = {2008},
  url          = {https://doi.org/10.1109/SNPD.2008.17},
  doi          = {10.1109/SNPD.2008.17},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/snpd/AgnarssonGK08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AgnarssonH07,
  author       = {Geir Agnarsson and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {Strongly simplicial vertices of powers of trees},
  journal      = {Discret. Math.},
  volume       = {307},
  number       = {21},
  pages        = {2647--2652},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.disc.2007.01.002},
  doi          = {10.1016/J.DISC.2007.01.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AgnarssonH07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AgnarssonC06,
  author       = {Geir Agnarsson and
                  Li Chen},
  title        = {On the extension of vertex maps to graph homomorphisms},
  journal      = {Discret. Math.},
  volume       = {306},
  number       = {17},
  pages        = {2021--2030},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disc.2006.04.009},
  doi          = {10.1016/J.DISC.2006.04.009},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AgnarssonC06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AgnarssonH04,
  author       = {Geir Agnarsson and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  editor       = {J. Ian Munro},
  title        = {On colorings of squares of outerplanar graphs},
  booktitle    = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
                  2004},
  pages        = {244--253},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {http://dl.acm.org/citation.cfm?id=982792.982827},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AgnarssonH04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AgnarssonH04,
  author       = {Geir Agnarsson and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  editor       = {Giuseppe Persiano and
                  Roberto Solis{-}Oba},
  title        = {Strong Colorings of Hypergraphs},
  booktitle    = {Approximation and Online Algorithms, Second International Workshop,
                  {WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {3351},
  pages        = {253--266},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-31833-0\_21},
  doi          = {10.1007/978-3-540-31833-0\_21},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/waoa/AgnarssonH04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AgnarssonDH03,
  author       = {Geir Agnarsson and
                  Peter Damaschke and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {Powers of geometric intersection graphs and dispersion algorithms},
  journal      = {Discret. Appl. Math.},
  volume       = {132},
  number       = {1-3},
  pages        = {3--16},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0166-218X(03)00386-X},
  doi          = {10.1016/S0166-218X(03)00386-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AgnarssonDH03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AgnarssonH03,
  author       = {Geir Agnarsson and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {Coloring Powers of Planar Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {16},
  number       = {4},
  pages        = {651--662},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0895480100367950},
  doi          = {10.1137/S0895480100367950},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/AgnarssonH03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/agtive/AgnarssonEH03,
  author       = {Geir Agnarsson and
                  {\'{A}}g{\'{u}}st S. Egilsson and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  editor       = {John L. Pfaltz and
                  Manfred Nagl and
                  Boris B{\"{o}}hlen},
  title        = {Proper Down-Coloring Simple Acyclic Digraphs},
  booktitle    = {Applications of Graph Transformations with Industrial Relevance, Second
                  International Workshop, {AGTIVE} 2003, Charlottesville, VA, USA, September
                  27 - October 1, 2003, Revised Selected and Invited Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {3062},
  pages        = {299--312},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/978-3-540-25959-6\_22},
  doi          = {10.1007/978-3-540-25959-6\_22},
  timestamp    = {Tue, 14 May 2019 10:00:49 +0200},
  biburl       = {https://dblp.org/rec/conf/agtive/AgnarssonEH03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgnarssonDH02,
  author       = {Geir Agnarsson and
                  Peter Damaschke and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  editor       = {Martti Penttonen and
                  Erik Meineche Schmidt},
  title        = {Powers of Geometric Intersection Graphs and Dispersion Algorithms},
  booktitle    = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
                  Theory, Turku, Finland, July 3-5, 2002 Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2368},
  pages        = {140--149},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45471-3\_15},
  doi          = {10.1007/3-540-45471-3\_15},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/AgnarssonDH02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AgnarssonDS01,
  author       = {Geir Agnarsson and
                  Benjamin Doerr and
                  Tomasz Schoen},
  title        = {Coloring \emph{t}-dimensional \emph{m}-Boxes},
  journal      = {Discret. Math.},
  volume       = {226},
  number       = {1-3},
  pages        = {21--33},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0012-365X(00)00180-1},
  doi          = {10.1016/S0012-365X(00)00180-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AgnarssonDS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AgnarssonH00,
  author       = {Geir Agnarsson and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  editor       = {David B. Shmoys},
  title        = {Coloring powers of planar graphs},
  booktitle    = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
  pages        = {654--662},
  publisher    = {{ACM/SIAM}},
  year         = {2000},
  url          = {http://dl.acm.org/citation.cfm?id=338219.338619},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AgnarssonH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AgnarssonFT99,
  author       = {Geir Agnarsson and
                  Stefan Felsner and
                  William T. Trotter},
  title        = {The maximum number of edges in a graph of bounded dimension, with
                  applications to ring theory},
  journal      = {Discret. Math.},
  volume       = {201},
  number       = {1-3},
  pages        = {5--19},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00309-4},
  doi          = {10.1016/S0012-365X(98)00309-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AgnarssonFT99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics