|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 9 keywords
|
|
|
|
|
Results
Found 44 publication records. Showing 44 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Matthias Kriesell |
Balancing two spanning trees.  |
Networks  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Matthias Kriesell |
On the problem of finding disjoint cycles and dicycles in a digraph. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Packing Steiner trees on four terminals. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | János Barát, Matthias Kriesell |
What is on his mind? |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell |
On the number of 4-contractible edges in 4-connected graphs. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Matthias Kriesell |
Disjoint sub(di)graphs in digraphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Matthias Kriesell |
Disjoint directed and undirected paths and cycles in digraphs. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Edge disjoint Steiner trees in graphs without large bridges. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabian Abel, Nicola Henze, Daniel Krause, Matthias Kriesell |
Semantic Enhancement of Social Tagging Systems. |
Web 2.0 & Semantic Web |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
On the number of contractible triples in 3-connected graphs. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Vertex suppression in 3-connected graphs. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabian Abel, Nicola Henze, Daniel Krause, Matthias Kriesell |
On the Effect of Group Structures on Ranking Strategies in Folksonomies. |
Weaving Services and People on the World Wide Web |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
A constructive characterization of 3-connected triangle-free graphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
How to contract an essentially 6-connected graph to a 5-connected graph. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
On Small Contractible Subgraphs in 3-connected Graphs of Small Average Degree. |
Graphs and Combinatorics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Contractions, cycle double covers, and cyclic colorings in locally connected graphs. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
There Exist Highly Critically Connected Graphs of Diameter Three. |
Graphs and Combinatorics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Kaiser, Matthias Kriesell |
On the Pancyclicity of Lexicographic Products. |
Graphs and Combinatorics |
2006 |
DBLP DOI BibTeX RDF |
Lexicographic product, Circumference, k-walk, Toughness, Pancyclicity |
| 1 | Matthias Kriesell |
Mader's Conjecture On Extremely Critical Graphs. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C40, 05C35, 05C75 |
| 1 | Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell |
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C40, 05C45, 05C70, 05C38 |
| 1 | Matthias Kriesell |
Average degree and contractibility. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Disjoint A-paths in digraphs. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Triangle Density and Contractibility. |
Combinatorics, Probability & Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Closed Separator Sets. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C40 |
| 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. |
ICCSA |
2005 |
DBLP DOI BibTeX RDF |
semantic web, personalized information management, web intelligence, web data extraction |
| 1 | Fabian Abel, Robert Baumgartner, Adrian Brooks, Christian Enzi, Georg Gottlob, Nicola Henze, Marcus Herzog, Matthias Kriesell, Wolfgang Nejdl, Kai Tomaschewski |
The Personal Publication Reader. |
International Semantic Web Conference |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Changtao Qu, Wolfgang Nejdl, Matthias Kriesell |
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs. |
ISPA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Edge-disjoint trees containing some given vertices in a graph. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | András Frank, Tamás Király, Matthias Kriesell |
On decomposing a hypergraph into k connected sub-hypergraphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity. |
Graphs and Combinatorics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph. |
Graphs and Combinatorics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
A Contribution to a Conjecture of A. Saito. |
Graphs and Combinatorics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Contractible Subgraphs in 3-Connected Graphs. |
J. Comb. Theory, Ser. B |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
The k-Critical 2k-Connected Graphs for kepsilon{3, 4}. |
J. Comb. Theory, Ser. B |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ekkehard Köhler, Matthias Kriesell |
Edge-Dominating Trails in AT-free Graphs (Extended Abstract). |
Electronic Notes in Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity. |
Electronic Notes in Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Contractible Non-Edges in Triangle-Free Graphs. |
Graphs and Combinatorics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
On k-Critical Connected Line Graphs. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
Contractible Non-edges in 3-Connected Graphs. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Kriesell |
A Note on Hamiltonian Cycles in Lexicographical Products. |
Journal of Automata, Languages and Combinatorics |
1997 |
DBLP BibTeX RDF |
|
Displaying result #1 - #44 of 44 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")