Publications

Publications

Journals/Books

  • Irene Heinrich and Peter Tittmann: Neighborhood and Domination Polynomials of Graphs. Graphs and Combinatorics November 2018, Volume 34, Issue 6, pp 1203–1216. 
    https://doi.org/10.1007/s00373-018-1968-7
  • Thomas Lange, Manja Reinwardt, and Peter Tittmann: A Recursive Formula for the Two-Edge Connected andBiconnected Reliability of a Complete Graph. Networks, 69 (2017) 4, 408-414.
  • Seongmin Ok and Peter Tittmann: The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications. arXiv, 12. Feb 2017. arxiv.org/abs/1702.03546
  • Irene Heinrich and Peter Tittmann: Counting Dominating Sets in Graphs. arXiv 12. Jan 2017 arxiv.org/abs/1701.03453
  • Peter Tittmann and Sara Kischnick: Structural Importance and Local Importance in Network Reliability. in Stanisław Zawiślak and Jacek Rysiński: Graph-Based Modelling in Engineering. Springer 2016.
  • Markus Dod, Tomer Kotek, James Preen, Peter Tittmann: Bipartition Polynomials, the Ising Model, and Domination in Graphs. Discussiones Mathematicae Graph Theory 35 (2015) 335-353, doi: 10.7151/dmgt.1808
  • Peter Tittmann: Einführung in die Kombinatorik, 2. Aufl. Springer Spektrum, 2014. 
    http://www.springer.com/978-3-642-54588-7
  • Tomer Kotek, James Preen, Peter Tittmann: Subset-Sum Representations of Domination Polynomials, Graphs and Combinatorics, Vol. 30 (2013) 647-660.
  • Tomer Kotek, James Preen, Frank Simon, Peter Tittmann, Martin Trinks: Recurrence relations and splitting formulas for the domination polynomial, The Electronic Journal of Combinatorics, Vol. 19 (2012) 3, P47.
  • Frank Beichelt and Peter Tittmann: Reliability and Maintenance: Networks and Systems, Chapman and Hall/CRC, 2012.
  • Klaus Dohmen and Peter Tittmann: Domination Reliability, The Electronic Journal of Combinatorics, Vol. 19 (2012) 1, 15pp.
  • Peter Tittmann: Graphentheorie: Eine anwendungsorientierte Einführung, 2. Auflage, Carl Hanser Verlag, 2011.
  • Peter Tittmann, Ilia Averbouch, Johann A. Makowsky: The enumeration of vertex induced subgraphs with respect to the number of components,  European Journal of Combinatorics, (2011), doi:10.1016/j.ejc.2011.03.017
  • Frank Simon, Peter Tittmann, Martin Trinks: Counting Connected Set Partitions of Graphs, Electron. J. Combin. 18 (2011), #P14.
  • Raymond Lapus, Frank Simon, Peter Tittmann: Random Information Spread in Networks, arXiv:1008.2081v1 [math.CO], 2010, 17 S.
  • Peter Tittmann: Graphs and Networks, in D. Ifenthaler, P. Pirnay-Dummer, N.M. Seel (Eds.): Computer-Based Diagnostics and Systematic Analysis of Knowledge, Springer, New York, 2010, 177-188.
  • Klaus Dohmen and Peter Tittmann: Improved Bonferroni Inequalities and Binomially Bounded Functions, Discrete Math. 310 (2010), 1265-1268.
  • Klaus Dohmen and Peter Tittmann: Bonferroni-Galambos Inequalities for Partition Lattices, Electron J. Combin. 11(1) (2004), Article R85, 9 S.
  • Klaus Dohmen and Peter Tittmann: Inequalities of Bonferroni-Galambos Type with Applications to the Tutte Polynomial and the Chromatic Polynomial, JIPAM, Journal of Inequalities in Pure and Applied Mathematics, 5(3) (2004), Article 64.
  • Klaus Dohmen and Andre Poenitz and Peter Tittmann: A new two-variable generalization of the chromatic polynomial.
    Discrete Mathematics & Theoretical Computer Science, Volume 6, n° 1 (2003), 69-90.
  • Peter Tittmann: Graphentheorie. Fachbuchverlag Leipzig, 2003.
  • Peter Tittmann: Einführung in die Kombinatorik. Spektrum Akademischer Verlag, Heidelberg, 2000.
  • André Pönitz and Peter Tittmann: Improved upper bounds for self-avoiding walks in Zd, The Electronic Journal of Combinatorics 7(2000), #R21.
  • Peter Tittmann: Partitions and network reliability, Discrete Applied Mathematics 95 (1999), 445-45.
  • Valeri Gorlov and Peter Tittmann: A unified approach to the reliability of recurrent structures, in Ellart von Collani et al. (editors): Advances in stochastic models for reliability, quality and safety, Birkhäuser, Boston, 1998.

Conference Contributions/Guest Lectures

  • Sara Kischnick and Peter Tittmann: Counting Rainbow Colorings in Special Unicyclic Graphs. CID 2017 Colorings, Independence and Domination, 17.-22.09.2017, Piechowice, Poland.
  • Peter Tittmann: On the Number of Dominating Sets of a Graph. Freiberger Graphentheorietage ,1.12.2016, TU Bergakademie Freiberg, 2016.
  • Peter Tittmann: Neighborhood Oriented Graph Polynomials, Kolloquium über Kombinatorik, Uni Paderborn, 04-05.11.2016.
  • Peter Tittmann: Bipartition Polynomials. Dagstuhl Seminar 16241: Graph Polynomials -- Towards a Comparative Theory, Schloss Dagstuhl, Germany, June 12-17, 2016.
  • Sara Kischnick and Peter Tittmann: Rainbow Independent Sets and Rainbow Partitions. SEICCGTC 2016, 47th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, March 7-11, 2016.
  • Peter Tittmann: Counting Two-edge Connected Graphs, SEG 2014, TU Chemnitz, 21. Jan. 2014.
  • Peter Tittmann: Counting Dominating Sets in Graphs, Kolloquium über Kombinatorik, TU Ilmenau, 8./9. November 2013.
  • Peter Tittmann, Markus Dod, Tomer Kotek, James Preen: generating Functions for the Number of Dominating Sets, CID2013, Szklarska Poręba, 15.-20. Sept. 2013.
  • Peter Tittmann: Domination Polynomials of Graphs, Kolloquium über Kombinatorik, Technische Universität Berlin 16./17. November 2012.
  • Peter Tittmann: Generating Functions for Counting Vertex-Induced Subgraphs, Freiberger Graphentheorietage 2011, TU Bergakademie Freiberg, 30. November 2011.
  • Peter Tittmann: Counting repelling matchings, Kolloquium über Kombinatorik 2011, Universität Magdeburg.
  • Ilia Averbouch, Johann Makowsky and Peter Tittmann: A case study in graph polynomials: The subgraph component polynomial, Workshop Logical Approaches to Barriers in Computing and Complexity, Greifswald, Germany, February 16-21, 2010.
  • Ilia Averbouch, Johann Makowsky and Peter Tittmann: A Graph Polynomial Arising from Community Structure, 35th Workshop on Graphtheoretic Concepts in Computer Science, WG 2009, June 24-26, 2009, Montpellier, France.
  • Peter Tittmann, Ilia Averbouch and Johann A. Makowsky: The Enumeration of Vertex Induced Subgraphs with respect to the Number of Components, AGT 2009, DIMAP Workshop on Algorithmic Graph Theory, University of Warwick, Coventry, UK, 23-25 March 2009.
  • Tittmann, P.: Partitionspolynome von Graphen, 3. Workshop Kombinatorik, Graphentheorie und Algorithmen, Hochschule für Technik und Wirtschaft, Dresden, 3. Juni 2008.
  • Tittmann, P.: Counting Vertex Partitions of Graphs, C5 Graph Theory Workshop, Rathen, March 8, 2008.
  • Tittmann, P.: Graph Theoretic Concepts for Social Network Analysis, Eurpean Workshop Intelligent Computational Methods and Applied Mathematics, ICMAM 2008, March 28-31, Cracow, Poland.
  • Tittmann, P.: Counting Connected Vertex Partitions, Thirty-Ninth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, USA, 3.-7. März 2008.
  • Tittmann, P.: Knotenpartitionen in stochastischen Netzwerken, Chemnitzer Workshop "Algorithmen und Graphen", TU Chemnitz, 14. Januar 2008.
  • Tittmann, P.: Graph Theory and Social Networks, ATH Bielsko-Biała, Polen, 1. Juni 2007.
  • Tittmann, P.: Algorithms for Optimization Problems on Recursively Defined Graphs, ATH Bielsko-Biała, Polen, 31. Mai 2007.
  • Tittmann, P.: Combinatorial Methods in Network Reliability, ATH Bielsko-Biała, Polen, 30. Mai 2007.
  • Tittmann, P.: Mathematische Modelle für die Ausbreitung von Störungen in Kommunikationsnetzen, BSI-Workshop IT-Frühwarnsysteme, Wissenschaftszentrum Bonn, 12. Juli 2006.
  • Tittmann, P.: Chromatic polynomials and clique partition polynomials. Kolloquium über Kombinatorik, Uni Magdeburg, 14.-15.11.2003.
  • Peter Tittmann: Endliche und unendliche Automaten in der enumerativen Kombinatorik. DMV- Jahrestagung, Universität Halle, Sept. 2002.
  • Udo Junghans and Peter Tittmann: A Comparison of Heuristic Methods for Path Decompositions of Graphs. Operations Research 2002, Universität Klagenfurt, 4. Sept. 2002.
  • Tittmann, P.: Selbstvermeidende Irrfahrten und endliche Automaten, Institutskolloquium an der Humboldt-Universität zu Berlin, Institut für Informatik, 13. Juli 2000.

Drucken

Datenschutz
Impressum
Kontakt