The SCEAS System
| |||||||

## Search the dblp DataBase
Ingo Schiermeyer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ingo Schiermeyer
**Approximating Maximum Independent Set in**[Citation Graph (0, 0)][DBLP]*k*-Clique-Free Graphs. APPROX, 1998, pp:159-168 [Conf] - Ingo Schiermeyer
**Solving 3-Satisfiability in Less Then 1, 579**[Citation Graph (0, 0)][DBLP]^{n}Steps. CSL, 1992, pp:379-394 [Conf] - Ingo Schiermeyer
**Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles.**[Citation Graph (0, 0)][DBLP] ESA, 1994, pp:290-299 [Conf] - Ingo Schiermeyer, Bert Randerath
**Colouring Graphs with Prescribed Induced Cycle Lengths.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:965-966 [Conf] - Ingo Schiermeyer
**A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph.**[Citation Graph (0, 0)][DBLP] WG, 1989, pp:211-217 [Conf] - Ingo Schiermeyer
**Deciding 3-Colourability in Less Than O(1.415^n) Steps.**[Citation Graph (0, 0)][DBLP] WG, 1993, pp:177-188 [Conf] - Ingo Schiermeyer
**An Approximation Algorithm for 3-Colourability.**[Citation Graph (0, 0)][DBLP] WG, 1995, pp:146-151 [Conf] - Ralph J. Faudree, Zdenek Ryjácek, Ingo Schiermeyer
**Local connectivity and cycle xtension in claw-free graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1997, v:47, n:, pp:- [Journal] - Stanislav Jendrol, Ingo Schiermeyer
**On a Max-min Problem Concerning Weights of Edges.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2001, v:21, n:3, pp:351-359 [Journal] - Hajo Broersma, Ingo Schiermeyer
**Subgraphs, Closures and Hamiltonicity.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:39-46 [Journal] - Bert Randerath, Ingo Schiermeyer
**3-Colorability in P for P**[Citation Graph (0, 0)][DBLP]_{6}-free graphs. Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:299-313 [Journal] - Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann
**Vertex pancyclic graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:219-237 [Journal] - Annette Schelten, Ingo Schiermeyer
**Ramsey Numbers r(K**[Citation Graph (0, 0)][DBLP]_{3}, G) for Connected Graphs G of Order Seven. Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:189-200 [Journal] - Uwe Schelten, Ingo Schiermeyer
**Small Cycles in Hamiltonian Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:201-211 [Journal] - Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer
**Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:256, n:1-2, pp:193-201 [Journal] - Jochen Harant, Ingo Schiermeyer
**On the independence number of a graph in terms of order and size.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:232, n:1-3, pp:131-138 [Journal] - Peter Mihók, Ingo Schiermeyer
**Cycle lengths and chromatic number of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:286, n:1-2, pp:147-149 [Journal] - Bert Randerath, Ingo Schiermeyer, Meike Tewes
**Three-colourability and forbidden subgraphs. II: polynomial algorithms.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:251, n:1-3, pp:137-153 [Journal] - Ingo Schiermeyer
**Rainbow numbers for matchings and complete graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:286, n:1-2, pp:157-162 [Journal] - Ingo Schiermeyer, Zsolt Tuza, Margit Voigt
**On-line rankings of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:212, n:1-2, pp:141-147 [Journal] - Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer
**Degree conditions for hamiltonicity: Counting the number of missing edges.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:7-8, pp:873-877 [Journal] - Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol, Katsuhiro Ota, Ingo Schiermeyer
**Independence number and vertex-disjoint cycles.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:11-12, pp:1493-1498 [Journal] - Ahmed Ainouche, Ingo Schiermeyer
**0-Dual Closures for Several Classes of Graphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:3, pp:297-307 [Journal] - Dieter Rautenbach, Ingo Schiermeyer
**Extremal Problems for Imbalanced Edges.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2006, v:22, n:1, pp:103-111 [Journal] - Ingo Schiermeyer, Meike Tewes
**Longest Paths and Longest Cycles in Graphs with Large Degree Sums.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2002, v:18, n:3, pp:633-643 [Journal] - Bert Randerath, Ingo Schiermeyer
**Vertex Colouring and Forbidden Subgraphs - A Survey.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2004, v:20, n:1, pp:1-40 [Journal] - Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer
**On Path-Tough Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1994, v:7, n:4, pp:571-584 [Journal] - Bert Randerath, Ingo Schiermeyer, Hong Wang
**On quadrilaterals in a graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:203, n:1-3, pp:229-237 [Journal] - Annette Schelten, Ingo Schiermeyer
**Ramsey numbers r(K**[Citation Graph (0, 0)][DBLP]_{3}, G) for G =~ K_{7}- 2P_{2}and G =~ K_{7}- 3P_{2}. Discrete Mathematics, 1998, v:191, n:1-3, pp:191-196 [Journal] - Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer
**A planarity criterion for cubic bipartite graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:191, n:1-3, pp:31-43 [Journal] - Zdenek Ryjácek, Ingo Schiermeyer
**2-factors and hamiltonicity.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:191, n:1-3, pp:171-177 [Journal] - Jan Brousek, Zdenek Ryjácek, Ingo Schiermeyer
**Forbidden subgraphs, stability and hamiltonicity.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:197, n:, pp:143-155 [Journal] - H. J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer
**Dirac's minimum degree condition restricted to claws.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:167, n:, pp:155-166 [Journal] - Ingo Schiermeyer
**Computation of the 0-dual closure for hamiltonian graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:111, n:1-3, pp:455-464 [Journal] - Zdenek Ryjácek, Ingo Schiermeyer
**On the independence number in K**[Citation Graph (0, 0)][DBLP]_{1, r+1}-free graphs. Discrete Mathematics, 1995, v:138, n:1-3, pp:365-374 [Journal] - H. J. Broersma, Ingo Schiermeyer
**A closure concept based on neighborhood unions of independent triples.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:124, n:1-3, pp:37-47 [Journal] - Ingo Schiermeyer
**The k-Satisfiability problem remains NP-complete for dense families.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:125, n:1-3, pp:343-346 [Journal] **Rainbow Connection in Graphs with Minimum Degree Three.**[Citation Graph (, )][DBLP]**An Asymptotic Result for the Path Partition Conjecture.**[Citation Graph (, )][DBLP]**Ramsey (K1, 2, K3)-Minimal Graphs.**[Citation Graph (, )][DBLP]**Efficiency in exponential time for domination-type problems.**[Citation Graph (, )][DBLP]**On maximum independent sets in P**[Citation Graph (, )][DBLP]_{5}-free graphs.**The independence number in graphs of maximum degree three.**[Citation Graph (, )][DBLP]**Colourings of graphs with two consecutive odd cycle lengths.**[Citation Graph (, )][DBLP]**On the circumference of a graph and its complement.**[Citation Graph (, )][DBLP]**Packing disjoint cycles over vertex cuts.**[Citation Graph (, )][DBLP]**Some results on Reed's Conjecture about omega, Delta, and chi with respect to alpha.**[Citation Graph (, )][DBLP]**Approximation algorithms for the minimum rainbow subgraph problem.**[Citation Graph (, )][DBLP]
Search in 0.059secs, Finished in 0.061secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |