| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stanislav Jendrol, Tomás Kaiser, Zdenek Ryjácek, Ingo Schiermeyer |
A Dirac theorem for trestles.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnfried Kemnitz, Ingo Schiermeyer |
Improved degree conditions for Hamiltonian properties. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer |
Closures, cycles, and paths. |
Journal of Graph Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ján Katrenic, Ingo Schiermeyer |
Improved approximation bounds for the minimum rainbow subgraph problem. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Kardos, Ján Katrenic, Ingo Schiermeyer |
On computing the minimum 3-path vertex cover and dissociation number of graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, Ingo Schiermeyer, Anders Yeo |
A New Bound on the Domination Number of Graphs with Minimum Degree Two. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer |
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnfried Kemnitz, Ingo Schiermeyer |
Graphs with rainbow connection number two. |
Discussiones Mathematicae Graph Theory |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
Bounds for the rainbow connection number of graphs. |
Discussiones Mathematicae Graph Theory |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jun Fujisawa, Akira Saito, Ingo Schiermeyer |
Closure for spanning trees and distant area. |
Discussiones Mathematicae Graph Theory |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stephan Matos Camacho, Ingo Schiermeyer, Zsolt Tuza |
Approximation algorithms for the minimum rainbow subgraph problem. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anja Kohl, Ingo Schiermeyer |
Some results on Reed's Conjecture about omega, Delta, and chi with respect to alpha. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel |
Packing disjoint cycles over vertex cuts. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer |
Random Procedures for Dominating Sets in Graphs. |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ingo Schiermeyer, Martin Sonntag, Hanns-Martin Teichert |
Structural Properties and Hamiltonicity of Neighborhood Graphs. |
Graphs and Combinatorics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Löwenstein, Dieter Rautenbach, Ingo Schiermeyer |
Cycle length parities and the chromatic number. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bert Randerath, Ingo Schiermeyer |
On maximum independent sets in P5-free graphs. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
Progress on Rainbow Connection. |
CTW |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ralph J. Faudree, Linda M. Lesniak, Ingo Schiermeyer |
On the circumference of a graph and its complement. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Matos Camacho, Ingo Schiermeyer |
Colourings of graphs with two consecutive odd cycle lengths. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinya Fujita, Atsushi Kaneko, Ingo Schiermeyer, Kazuhiro Suzuki |
A Rainbow k-Matching in the Complete Graph with r Colors. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer |
On F-independence in graphs. |
Discussiones Mathematicae Graph Theory |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
Rainbow Connection in Graphs with Minimum Degree Three. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer |
The independence number in graphs of maximum degree three. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Ralph J. Faudree, Xuechao Li, Ingo Schiermeyer |
Non-path spectrum sets. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
Efficiency in exponential time for domination-type problems. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Bert Randerath, Ingo Schiermeyer |
On the complexity of 4-coloring graphs without long induced paths. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer |
Degree conditions for hamiltonicity: Counting the number of missing edges. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol, Katsuhiro Ota, Ingo Schiermeyer |
Independence number and vertex-disjoint cycles. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Axenovich, Heiko Harborth, Arnfried Kemnitz, Meinhard Möller, Ingo Schiermeyer |
Rainbows in the Hypercube. |
Graphs and Combinatorics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Schiermeyer, Mariusz Wozniak |
New sufficient conditions for hamiltonian and pancyclic graphs. |
Discussiones Mathematicae Graph Theory |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
A new upper bound for the chromatic number of a graph. |
Discussiones Mathematicae Graph Theory |
2007 |
DBLP BibTeX RDF |
|
| 1 | Guantao Chen, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer |
Chvátal Erdós condition and 2-factors with a specyfied number of components. |
Discussiones Mathematicae Graph Theory |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
Upper bounds for the chromatic number of a graph. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Ingo Schiermeyer |
Extremal Problems for Imbalanced Edges. |
Graphs and Combinatorics |
2006 |
DBLP DOI BibTeX RDF |
extremal graph, irregularity, Imbalance |
| 1 | Evelyne Flandrin, Hao Li, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak |
Chvátal-Erdös condition and pancyclism. |
Discussiones Mathematicae Graph Theory |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jochen Harant, Ingo Schiermeyer |
A lower bound on the independence number of a graph in terms of degrees. |
Discussiones Mathematicae Graph Theory |
2006 |
DBLP BibTeX RDF |
|
| 1 | Marietjie Frick, Ingo Schiermeyer |
An Asymptotic Result for the Path Partition Conjecture. |
Electr. J. Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Mieczyslaw Borowiecki, Ingo Schiermeyer, Elzbieta Sidorowicz |
Ramsey (K1,2,K3)-Minimal Graphs. |
Electr. J. Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
The Cycle-Complete Graph Ramsey Number r(C5, K7). |
Discussiones Mathematicae Graph Theory |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
Rainbow numbers for matchings and complete graphs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Mihók, Ingo Schiermeyer |
Cycle lengths and chromatic number of graphs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bert Randerath, Ingo Schiermeyer |
Vertex Colouring and Forbidden Subgraphs - A Survey. |
Graphs and Combinatorics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bert Randerath, Ingo Schiermeyer |
3-Colorability in P for P6-free graphs. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmed Ainouche, Ingo Schiermeyer |
0-Dual Closures for Several Classes of Graphs. |
Graphs and Combinatorics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Bert Randerath, Ingo Schiermeyer, Meike Tewes |
Three-colourability and forbidden subgraphs. II: polynomial algorithms. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer |
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Schiermeyer, Meike Tewes |
Longest Paths and Longest Cycles in Graphs with Large Degree Sums. |
Graphs and Combinatorics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann |
Vertex pancyclic graphs. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Bert Randerath, Ingo Schiermeyer |
3-Colorability element oF P for p6-free Graphs. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Ingo Schiermeyer |
On the independence number of a graph in terms of order and size. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanislav Jendrol, Ingo Schiermeyer |
On a Max-min Problem Concerning Weights of Edges. |
Combinatorica |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C35 |
| 1 | Ingo Schiermeyer, Zsolt Tuza, Margit Voigt |
On-line rankings of graphs. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Zdenek Ryjácek, Ingo Schiermeyer |
Closure Concepts: A Survey. |
Graphs and Combinatorics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes |
Vertex Pancyclic Graphs. |
Electronic Notes in Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Annette Schelten, Ingo Schiermeyer, Ralph J. Faudree |
3-colored Ramsey Numbers of Odd Cycles. |
Electronic Notes in Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Brousek, Zdenek Ryjácek, Ingo Schiermeyer |
Forbidden subgraphs, stability and hamiltonicity. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Bert Randerath, Ingo Schiermeyer, Hong Wang 0022 |
On quadrilaterals in a graph. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Schiermeyer, Bert Randerath |
Colouring Graphs with Prescribed Induced Cycle Lengths. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Ryjácek, Ingo Schiermeyer |
2-factors and hamiltonicity. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Annette Schelten, Ingo Schiermeyer |
Ramsey numbers r(K3, G) for G =~ K7 - 2P2 and G =~ K7 - 3P2. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer |
A planarity criterion for cubic bipartite graphs. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
Approximating Maximum Independent Set in k-Clique-Free Graphs. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
k-Clique, Algorithm, Complexity, Approximation, Graph, Maximum Independent Set |
| 1 | H. J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer |
Dirac's minimum degree condition restricted to claws. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Annette Schelten, Ingo Schiermeyer |
Ramsey Numbers r(K3, G) for Connected Graphs G of Order Seven. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Uwe Schelten, Ingo Schiermeyer |
Small Cycles in Hamiltonian Graphs. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralph J. Faudree, Zdenek Ryjácek, Ingo Schiermeyer |
Local connectivity and cycle xtension in claw-free graphs. |
Ars Comb. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Zdenek Ryjácek, Ingo Schiermeyer |
On the independence number in K1, r+1-free graphs. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
An Approximation Algorithm for 3-Colourability. |
WG |
1995 |
DBLP DOI BibTeX RDF |
k-colouring, exact and approximation algorithm, complexity, Graph |
| 1 | Ingo Schiermeyer |
The k-Satisfiability problem remains NP-complete for dense families. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | H. J. Broersma, Ingo Schiermeyer |
A closure concept based on neighborhood unions of independent triples. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer |
On Path-Tough Graphs. |
SIAM J. Discrete Math. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Ingo Schiermeyer |
Subgraphs, Closures and Hamiltonicity. |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles. |
ESA |
1994 |
DBLP DOI BibTeX RDF |
level-oriented packing algorithm, two-dimensional packing, k-rectangle packing problem, rectangle packing conjecture, bin-packing |
| 1 | Ingo Schiermeyer |
Computation of the 0-dual closure for hamiltonian graphs. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
Deciding 3-Colourability in Less Than O(1.415^n) Steps. |
WG |
1993 |
DBLP DOI BibTeX RDF |
k-colouring, algorithm, complexity, Graph |
| 1 | Ingo Schiermeyer |
Solving 3-Satisfiability in Less Then 1, 579n Steps. |
CSL |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ingo Schiermeyer |
A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph. |
WG |
1989 |
DBLP DOI BibTeX RDF |
sequential and parallel graph algorithms, polylog parallel algorithm, computational complexity, random graphs, graph properties, hamiltonian graphs |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")