The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Matthias Kriesell: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Robert Baumgartner, Christian Enzi, Nicola Henze, Marc Herrlich, Marcus Herzog, Matthias Kriesell, Kai Tomaschewski
    Semantic Web Enabled Information Systems: Personalized Views on Web Data. [Citation Graph (0, 0)][DBLP]
    ICCSA (2), 2005, pp:988-997 [Conf]
  2. Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
    Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs. [Citation Graph (0, 0)][DBLP]
    ISPA, 2004, pp:914-925 [Conf]
  3. Fabian Abel, Robert Baumgartner, Adrian Brooks, Christian Enzi, Georg Gottlob, Nicola Henze, Marcus Herzog, Matthias Kriesell, Wolfgang Nejdl, Kai Tomaschewski
    The Personal Publication Reader. [Citation Graph (0, 0)][DBLP]
    International Semantic Web Conference, 2005, pp:1050-1053 [Conf]
  4. Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell
    Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:1, pp:17-36 [Journal]
  5. Matthias Kriesell
    Closed Separator Sets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:5, pp:575-598 [Journal]
  6. Matthias Kriesell
    Mader's Conjecture On Extremely Critical Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:3, pp:277-314 [Journal]
  7. Matthias Kriesell
    Triangle Density and Contractibility. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:1-2, pp:133-146 [Journal]
  8. András Frank, Tamás Király, Matthias Kriesell
    On decomposing a hypergraph into k connected sub-hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:373-383 [Journal]
  9. Matthias Kriesell
    How to contract an essentially 6-connected graph to a 5-connected graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:494-510 [Journal]
  10. Tomás Kaiser, Matthias Kriesell
    On the Pancyclicity of Lexicographic Products. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:1, pp:51-58 [Journal]
  11. Matthias Kriesell
    A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:1, pp:1-30 [Journal]
  12. Matthias Kriesell
    Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:1, pp:133-146 [Journal]
  13. Matthias Kriesell
    A Contribution to a Conjecture of A. Saito. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:3, pp:565-571 [Journal]
  14. Matthias Kriesell
    A Note on Hamiltonian Cycles in Lexicographical Products. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1997, v:2, n:2, pp:135-142 [Journal]
  15. Matthias Kriesell
    Contractible Subgraphs in 3-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:32-48 [Journal]
  16. Matthias Kriesell
    The k-Critical 2k-Connected Graphs for kepsilon{3, 4}. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:78, n:1, pp:69-80 [Journal]
  17. Matthias Kriesell
    Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:305-319 [Journal]
  18. Matthias Kriesell
    A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:81-101 [Journal]
  19. Matthias Kriesell
    All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:2, pp:306-315 [Journal]
  20. Matthias Kriesell
    Edge-disjoint trees containing some given vertices in a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:1, pp:53-65 [Journal]
  21. Matthias Kriesell
    Disjoint A-paths in digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:95, n:1, pp:168-172 [Journal]
  22. Matthias Kriesell
    On k-Critical Connected Line Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:1, pp:1-7 [Journal]
  23. Matthias Kriesell
    Contractible Non-edges in 3-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:2, pp:192-201 [Journal]
  24. Matthias Kriesell
    Contractions, cycle double covers, and cyclic colorings in locally connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:881-900 [Journal]
  25. Matthias Kriesell
    A constructive characterization of 3-connected triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:3, pp:358-370 [Journal]
  26. Matthias Kriesell
    Average degree and contractibility. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:3, pp:205-224 [Journal]

  27. On the Effect of Group Structures on Ranking Strategies in Folksonomies. [Citation Graph (, )][DBLP]


  28. On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs. [Citation Graph (, )][DBLP]


  29. What is on his mind? [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.154secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002