| 2008 |
|---|
| 47 | EE | Ingo Schiermeyer:
Efficiency in exponential time for domination-type problems.
Discrete Applied Mathematics 156(17): 3291-3297 (2008) |
| 46 | EE | Jochen Harant,
Michael A. Henning,
Dieter Rautenbach,
Ingo Schiermeyer:
The independence number in graphs of maximum degree three.
Discrete Mathematics 308(23): 5829-5833 (2008) |
| 45 | EE | Guantao Chen,
Ralph J. Faudree,
Xuechao Li,
Ingo Schiermeyer:
Non-path spectrum sets.
Journal of Graph Theory 58(4): 329-350 (2008) |
| 2007 |
|---|
| 44 | EE | Yoshimi Egawa,
Hikoe Enomoto,
Stanislav Jendrol,
Katsuhiro Ota,
Ingo Schiermeyer:
Independence number and vertex-disjoint cycles.
Discrete Mathematics 307(11-12): 1493-1498 (2007) |
| 43 | EE | Ralph J. Faudree,
Richard H. Schelp,
Akira Saito,
Ingo Schiermeyer:
Degree conditions for hamiltonicity: Counting the number of missing edges.
Discrete Mathematics 307(7-8): 873-877 (2007) |
| 42 | EE | Van Bang Le,
Bert Randerath,
Ingo Schiermeyer:
On the complexity of 4-coloring graphs without long induced paths.
Theor. Comput. Sci. 389(1-2): 330-335 (2007) |
| 2006 |
|---|
| 41 | EE | Ingo Schiermeyer:
Upper bounds for the chromatic number of a graph.
Electronic Notes in Discrete Mathematics 25: 147-148 (2006) |
| 40 | EE | Dieter Rautenbach,
Ingo Schiermeyer:
Extremal Problems for Imbalanced Edges.
Graphs and Combinatorics 22(1): 103-111 (2006) |
| 2005 |
|---|
| 39 | EE | Marietjie Frick,
Ingo Schiermeyer:
An Asymptotic Result for the Path Partition Conjecture.
Electr. J. Comb. 12: (2005) |
| 38 | EE | Mieczyslaw Borowiecki,
Ingo Schiermeyer,
Elzbieta Sidorowicz:
Ramsey (K1, 2, K3)-Minimal Graphs.
Electr. J. Comb. 12: (2005) |
| 2004 |
|---|
| 37 | EE | Bert Randerath,
Ingo Schiermeyer:
3-Colorability in P for P6-free graphs.
Discrete Applied Mathematics 136(2-3): 299-313 (2004) |
| 36 | EE | Peter Mihók,
Ingo Schiermeyer:
Cycle lengths and chromatic number of graphs.
Discrete Mathematics 286(1-2): 147-149 (2004) |
| 35 | EE | Ingo Schiermeyer:
Rainbow numbers for matchings and complete graphs.
Discrete Mathematics 286(1-2): 157-162 (2004) |
| 34 | EE | Bert Randerath,
Ingo Schiermeyer:
Vertex Colouring and Forbidden Subgraphs - A Survey.
Graphs and Combinatorics 20(1): 1-40 (2004) |
| 2003 |
|---|
| 33 | EE | Ahmed Ainouche,
Ingo Schiermeyer:
0-Dual Closures for Several Classes of Graphs.
Graphs and Combinatorics 19(3): 297-307 (2003) |
| 2002 |
|---|
| 32 | | Bert Randerath,
Ingo Schiermeyer,
Meike Tewes,
Lutz Volkmann:
Vertex pancyclic graphs.
Discrete Applied Mathematics 120(1-3): 219-237 (2002) |
| 31 | EE | Bert Randerath,
Ingo Schiermeyer,
Meike Tewes:
Three-colourability and forbidden subgraphs. II: polynomial algorithms.
Discrete Mathematics 251(1-3): 137-153 (2002) |
| 30 | EE | Jochen Harant,
Zdenek Ryjácek,
Ingo Schiermeyer:
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.
Discrete Mathematics 256(1-2): 193-201 (2002) |
| 29 | EE | Ingo Schiermeyer,
Meike Tewes:
Longest Paths and Longest Cycles in Graphs with Large Degree Sums.
Graphs and Combinatorics 18(3): 633-643 (2002) |
| 2001 |
|---|
| 28 | EE | Stanislav Jendrol,
Ingo Schiermeyer:
On a Max-min Problem Concerning Weights of Edges.
Combinatorica 21(3): 351-359 (2001) |
| 27 | EE | Jochen Harant,
Ingo Schiermeyer:
On the independence number of a graph in terms of order and size.
Discrete Mathematics 232(1-3): 131-138 (2001) |
| 26 | EE | Bert Randerath,
Ingo Schiermeyer:
3-Colorability element oF P for p6-free Graphs.
Electronic Notes in Discrete Mathematics 8: 85-89 (2001) |
| 2000 |
|---|
| 25 | EE | Ingo Schiermeyer,
Zsolt Tuza,
Margit Voigt:
On-line rankings of graphs.
Discrete Mathematics 212(1-2): 141-147 (2000) |
| 1999 |
|---|
| 24 | EE | Ingo Schiermeyer,
Bert Randerath:
Colouring Graphs with Prescribed Induced Cycle Lengths.
SODA 1999: 965-966 |
| 23 | EE | Jan Brousek,
Zdenek Ryjácek,
Ingo Schiermeyer:
Forbidden subgraphs, stability and hamiltonicity.
Discrete Mathematics 197-198: 143-155 (1999) |
| 22 | EE | Bert Randerath,
Ingo Schiermeyer,
Hong Wang:
On quadrilaterals in a graph.
Discrete Mathematics 203(1-3): 229-237 (1999) |
| 21 | EE | Bert Randerath,
Lutz Volkmann,
Ingo Schiermeyer,
Meike Tewes:
Vertex Pancyclic Graphs.
Electronic Notes in Discrete Mathematics 3: 166-170 (1999) |
| 20 | EE | Annette Schelten,
Ingo Schiermeyer,
Ralph J. Faudree:
3-colored Ramsey Numbers of Odd Cycles.
Electronic Notes in Discrete Mathematics 3: 176-178 (1999) |
| 1998 |
|---|
| 19 | EE | Ingo Schiermeyer:
Approximating Maximum Independent Set in k-Clique-Free Graphs.
APPROX 1998: 159-168 |
| 18 | EE | Zdenek Ryjácek,
Ingo Schiermeyer:
2-factors and hamiltonicity.
Discrete Mathematics 191(1-3): 171-177 (1998) |
| 17 | EE | Annette Schelten,
Ingo Schiermeyer:
Ramsey numbers r(K3, G) for G =~ K7 - 2P2 and G =~ K7 - 3P2.
Discrete Mathematics 191(1-3): 191-196 (1998) |
| 16 | EE | Thomas Böhme,
Jochen Harant,
Anja Pruchnewski,
Ingo Schiermeyer:
A planarity criterion for cubic bipartite graphs.
Discrete Mathematics 191(1-3): 31-43 (1998) |
| 1997 |
|---|
| 15 | | Ralph J. Faudree,
Zdenek Ryjácek,
Ingo Schiermeyer:
Local connectivity and cycle xtension in claw-free graphs.
Ars Comb. 47: (1997) |
| 14 | EE | Annette Schelten,
Ingo Schiermeyer:
Ramsey Numbers r(K3, G) for Connected Graphs G of Order Seven.
Discrete Applied Mathematics 79(1-3): 189-200 (1997) |
| 13 | EE | Uwe Schelten,
Ingo Schiermeyer:
Small Cycles in Hamiltonian Graphs.
Discrete Applied Mathematics 79(1-3): 201-211 (1997) |
| 12 | EE | H. J. Broersma,
Zdenek Ryjácek,
Ingo Schiermeyer:
Dirac's minimum degree condition restricted to claws.
Discrete Mathematics 167-168: 155-166 (1997) |
| 1995 |
|---|
| 11 | | Ingo Schiermeyer:
An Approximation Algorithm for 3-Colourability.
WG 1995: 146-151 |
| 10 | EE | Zdenek Ryjácek,
Ingo Schiermeyer:
On the independence number in K1, r+1-free graphs.
Discrete Mathematics 138(1-3): 365-374 (1995) |
| 1994 |
|---|
| 9 | | Ingo Schiermeyer:
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles.
ESA 1994: 290-299 |
| 8 | EE | Hajo Broersma,
Ingo Schiermeyer:
Subgraphs, Closures and Hamiltonicity.
Discrete Applied Mathematics 51(1-2): 39-46 (1994) |
| 7 | EE | H. J. Broersma,
Ingo Schiermeyer:
A closure concept based on neighborhood unions of independent triples.
Discrete Mathematics 124(1-3): 37-47 (1994) |
| 6 | EE | Ingo Schiermeyer:
The k-Satisfiability problem remains NP-complete for dense families.
Discrete Mathematics 125(1-3): 343-346 (1994) |
| 5 | EE | Peter Dankelmann,
Thomas Niessen,
Ingo Schiermeyer:
On Path-Tough Graphs.
SIAM J. Discrete Math. 7(4): 571-584 (1994) |
| 1993 |
|---|
| 4 | | Ingo Schiermeyer:
Deciding 3-Colourability in Less Than O(1.415^n) Steps.
WG 1993: 177-188 |
| 3 | EE | Ingo Schiermeyer:
Computation of the 0-dual closure for hamiltonian graphs.
Discrete Mathematics 111(1-3): 455-464 (1993) |
| 1992 |
|---|
| 2 | | Ingo Schiermeyer:
Solving 3-Satisfiability in Less Then 1, 579n Steps.
CSL 1992: 379-394 |
| 1989 |
|---|
| 1 | | Ingo Schiermeyer:
A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph.
WG 1989: 211-217 |
