Publikationen von Prof. Dr. Matthias Kriesell

Editorial Activities:

3. The Electronic Journal of Combinatorics

2. Discrete Mathematics & Theoretical Computer Science

1. AKCE International Journal of Graphs and Combinatorics

Publikationen im Fachgebiet

Anzahl der Treffer: 197
Erstellt: Sun, 28 Apr 2024 17:05:02 +0200 in 0.0414 sec
Seite 15 von 20 (⋎ Alle anzeigen )
  •  <# 
  •  < 
  •  10 
  •  11 
  •  12 
  •  13 
  •  14 
  •  15 
  •  16 
  •  17 
  •  18 
  •  19 
  •  20 
  •  > 
  •  #> 
    •


    Caro, Yair; Rautenbach, Dieter
    Reconstructing graphs from size and degree properties of their induced k-subgraphs. - In: Discrete mathematics, Bd. 307 (2007), 6, S. 694-703

    http://dx.doi.org/10.1016/j.disc.2006.06.031
    Hexel, Erhard;
    On short paths through prescribed vertices of a graph. - In: Discrete mathematics, Bd. 307 (2007), 7/8, S. 905-910

    http://dx.doi.org/10.1016/j.disc.2005.11.040
    Schreyer, Jens;
    Almost every graph is vertex-oblique. - In: Discrete mathematics, Bd. 307 (2007), 7/8, S. 983-989

    http://dx.doi.org/10.1016/j.disc.2005.11.054
    Rautenbach, Dieter; Schiermeyer, Ingo
    Extremal problems for imbalanced edges. - In: Graphs and combinatorics, ISSN 1435-5914, Bd. 22 (2006), 1, S. 103-111

    http://dx.doi.org/10.1007/s00373-005-0643-y
    Favaron, Odile; Laskar, Renu; Rautenbach, Dieter
    t-partitions and s-complete t-partitions of a graph. - In: The Australasian journal of combinatorics, ISSN 1034-4942, Bd. 36 (2006), S. 295-302

    Rautenbach, Dieter; Brandstädt, Andreas; Le, Van Bang
    Distance-hereditary 5-leaf powers. - In: Electronic notes in discrete mathematics, ISSN 1571-0653, Bd. 27 (2006), S. 85-86

    http://dx.doi.org/10.1016/j.endm.2006.08.068
    Rautenbach, Dieter; Szegedy, Christian; Werber, Jürgen
    Delay optimization of linear depth boolean circuits with prescribed input arrival times. - In: Journal of discrete algorithms, Bd. 4 (2006), 4, S. 526-537

    http://dx.doi.org/10.1016/j.jda.2005.06.006
    Hexel, Erhard;
    On short cycles through prescribed vertices of a polyhedral graph. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 25 (2005), 3, S. 419-426

    https://doi.org/10.7151/dmgt.1293
    Witschel, Hans Friedrich; Böhme, Thomas
    Evaluating profiling and query expansion methods for P2P information retrieval. - In: Proceedings of the 2005 ACM Workshop on Information Retrieval in Peer-to-Peer Networks, (2005), S. 1-8

    Kohl, Anja; Schreyer, Jens; Tuza, Zsolt; Voigt, Margit
    List version of L(d,s)-labelings. - In: Theoretical computer science, Bd. 349 (2005), 1, S. 92-98

    http://dx.doi.org/10.1016/j.tcs.2005.09.032

    Seite 15 von 20 (⋎ Alle anzeigen )
  •  <# 
  •  < 
  •  10 
  •  11 
  •  12 
  •  13 
  •  14 
  •  15 
  •  16 
  •  17 
  •  18 
  •  19 
  •  20 
  •  > 
  •  #> 
    •