Dr. rer. nat. habil. Peter Wagner

Arbeitsgruppe 'Diskrete Mathematik'

Publikationen

  • Schlage-Puchta, J.-C.; Wagner, P.
    Complete graphs with no rainbow tree.
    Journal of Graph Theory (2019), wileyonlinelibrary.com.
  • Wagner, P.
    Vitality heterogeneity in the Strehler–Mildvan theory of mortality.
    Mathematical Biosciences (2018) 300, 27–35.
  • "Constraint satisfaction problems on specific subsets of the n-dimensional unit cube",
    Kollaboration mit Levon Aslanyan, Hans-Dietrich Gronau und Hasmik Sahakyan,
    Proceedings CSIT 2015,
    IEEE, 47–52
  • Habilitationsschrift "Topics in Graph Theory",
    Universität Rostock, eingereicht am 19.12.2014
  • "Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree",
    Kollaboration mit Klas Markström und Andrew Thomason,
    Graphs and Combinatorics (2011) 27, 243–249
  • "Sensitivity of life disparity with respect to changes in mortality rates",
    Demographic Research (2010) 23, 63–72
  • "Rooted directed path graphs are leaf powers",
    Kollaboration mit Andreas Brandstädt, Christian Hundt und Federico Mancini,
    Discrete Mathematics (2010) 310, 897–910
  • "Characterising (k,l)-leaf powers",
    Kollaboration mit Andreas Brandstädt,
    Discrete Applied Mathematics (2010) 158, 110–122
  • "The complete inclusion structure of leaf power classes",
    Kollaboration mit Andreas Brandstädt,
    Theoretical Computer Science (2009) 410, 5505–5514
  • "Bounding the size of square-free subgraphs of the hypercube",
    Kollaboration mit Andrew Thomason,
    Discrete Mathematics (2009) 309, 1730–1735
  • "On k- Versus (k+1)-Leaf Powers",
    Kollaboration mit Andreas Brandstädt,
    Proceedings COCOA 2008 (2nd Annual International Conference on Combinatorial Optimization and Applications),
    LNCS (Lecture Notes in Computer Science) 5165, 171–179
  • "On (k,l)-Leaf Powers",
    Kollaboration mit Andreas Brandstädt,
    Proceedings MFCS 2007 (32nd International Symposium on Mathematical Foundations of Computer Science),
    LNCS (Lecture Notes in Computer Science) 4708, 525–535
  • "Complete Graphs with No Rainbow Path",
    Kollaboration mit Andrew Thomason,
    Journal of Graph Theory (2007) 54, 261–266
  • Doktorarbeit "The Ramsey Theory of Multicoloured Graphs",
    University of Cambridge, eingereicht im Dezember 2005, verteidigt im April 2006, veröffentlicht im Juli 2006
  • "An Upper Bound for Constrained Ramsey Numbers",
    Combinatorics, Probability and Computing (2006) 15, 619–626