Ingo Schiermeyer
Ingo Schiermeyer
Professor für angewandte diskrete Mathematik
Verified email at tu-freiberg.de
Title
Cited by
Cited by
Year
Reverse-fit: A 2-optimal algorithm for packing rectangles
I Schiermeyer
European Symposium on Algorithms, 290-299, 1994
1251994
Vertex colouring and forbidden subgraphs–a survey
B Randerath, I Schiermeyer
Graphs and Combinatorics 20 (1), 1-40, 2004
1232004
3-Colorability∈ P for P6-free graphs
B Randerath, I Schiermeyer
Discrete Applied Mathematics 136 (2-3), 299-313, 2004
942004
Solving 3-satisfiability in less than 1, 579n steps
I Schiermeyer
International Workshop on Computer Science Logic, 379-394, 1992
901992
Rainbow connection in graphs with minimum degree three
I Schiermeyer
International Workshop on Combinatorial Algorithms, 432-437, 2009
792009
Pure Literal Look Ahead: An O (1,497^ n) 3-Satisfiability Algorithm
I Schiermeyer
791996
On computing the minimum 3-path vertex cover and dissociation number of graphs
F Kardoš, J Katrenič, I Schiermeyer
Theoretical Computer Science 412 (50), 7009-7017, 2011
692011
Exact algorithms for minimum dominating set
B Randerath, I Schiermeyer
Zentrum für Angewandte Informatik Köln, Lehrstuhl Speckenmeyer, Tech. Rep, 2004
682004
Rainbow numbers for matchings and complete graphs
I Schiermeyer
Discrete Mathematics 286 (1-2), 157-162, 2004
632004
Three-colourability and forbidden subgraphs. II: polynomial algorithms
B Randerath, I Schiermeyer, M Tewes
Discrete mathematics 251 (1-3), 137-153, 2002
582002
On the independence number of a graph in terms of order and size
J Harant, I Schiermeyer
Discrete Mathematics 232 (1-3), 131-138, 2001
552001
Graphs with rainbow connection number two
A Kemnitz, I Schiermeyer
Discussiones Mathematicae Graph Theory 31 (2), 313-320, 2011
502011
Degree conditions for k‐ordered hamiltonian graphs
RJ Faudree, RJ Gould, AV Kostochka, L Lesniak, I Schiermeyer, A Saito
Journal of Graph Theory 42 (3), 199-210, 2003
492003
Closure concepts: a survey
H Broersma, Z Ryjáček, I Schiermeyer
Graphs and Combinatorics 16 (1), 17-48, 2000
432000
Forbidden subgraphs and cycle extendability
RJ Faudree, Z Ryjacek, I Schiermeyer
JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING 19, 109-128, 1995
391995
Vertex pancyclic graphs
B Randerath, I Schiermeyer, M Tewes, L Volkmann
Discrete Applied Mathematics 120 (1-3), 219-237, 2002
382002
On the complexity of 4-coloring graphs without long induced paths
B Randerath, I Schiermeyer
Theoretical Computer Science 389 (1-2), 330-335, 2007
352007
On minimally rainbow k-connected graphs
I Schiermeyer
Discrete Applied Mathematics 161 (4-5), 702-705, 2013
342013
Forbidden subgraphs and pancyclicity
R Faudree, RJ Gould, Z Ryjácek, I Schiermeyer
Congressus Numerantium, 13-32, 1995
321995
Rainbow connection number of dense graphs
X Li, M Liu, I Schiermeyer
Discussiones Mathematicae Graph Theory 33 (3), 603-611, 2013
312013
The system can't perform the operation now. Try again later.
Articles 1–20