Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Schiermeyer, Ingo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Rainbow numbers for cycles in plane triangulations
Mirko Horn̑ák
,
Stanislav Jendrol'
,
Ingo Schiermeyer
,
Roman Soták
Journal of Graph Theory
78
(4), 2015, pp. 248-257
Closures, cycles, and paths
Jochen Harant
,
Arnfried Kemnitz
,
Akira Saito
,
Ingo Schiermeyer
Journal of Graph Theory
69
(3), 2012, pp. 314-323
Dense arbitrarily vertex decomposable graphs
Mirko Horn̑ák
,
Antoni Marczyk
,
Ingo Schiermeyer
,
Mariusz Woźniak
Graphs and Combinatorics
28
(6), 2012, pp. 807-821
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
Jun Fujisawa
,
Shinya Fujita
,
Michael D. Plummer
,
Akira Saito
,
Ingo Schiermeyer
Combinatorica
31
(6), 2011, pp. 703-723
On computing the minimum 3-path vertex cover and dissociation number of graphs
Frantis̑ek Kardos̑
,
Ján Katrenic̑
,
Ingo Schiermeyer
Theoretical Computer Science
412
(50), 2011, pp. 7009-7017
Improved approximation bounds for the minimum rainbow subgraph problem
Ján Katrenic̑
,
Ingo Schiermeyer
Information Processing Letters
111
(3), 2011, pp. 110-114
Cycle length parities and the chromatic number
Christian Löwenstein
,
Dieter Rautenbach
,
Ingo Schiermeyer
Journal of Graph Theory
64
(3), 2010, pp. 210-218
Structural properties and Hamiltonicity of neighborhood graphs
Ingo Schiermeyer
,
Martin Sonntag
,
Hanns-Martin Teichert
Graphs and Combinatorics
26
(3), 2010, pp. 433-456
Non-path spectrum sets
Guantao Chen
,
Ralph J. Faudree
,
Xuechao Li
,
Ingo Schiermeyer
Journal of Graph Theory
58
(4), 2008, pp. 329-350
Rainbows in the hypercube
Maria Axenovich
,
Heiko Harborth
,
Arnfried Kemnitz
,
Meinhard Möller
,
Ingo Schiermeyer
Graphs and Combinatorics
23
(2), 2007, pp. 123-133
On the complexity of 4-coloring graphs without long induced paths
Van Bang Le
,
Bert Randerath
,
Ingo Schiermeyer
Theoretical Computer Science
389
(1-2), 2007, pp. 330-335
Extremal problems for imbalanced edges
Dieter Rautenbach
,
Ingo Schiermeyer
Graphs and Combinatorics
22
(1), 2006, pp. 103-111
Vertex colouring and forbidden subgraphs - A survey
Bert Randerath
,
Ingo Schiermeyer
Graphs and Combinatorics
20
(1), 2004, pp. 1-40
0-dual closures for several classes of graphs
Ahmed Ainouche
,
Ingo Schiermeyer
Graphs and Combinatorics
19
(3), 2003, pp. 297-307
Two-factors each component of which contains a specified vertex
Yoshimi Egawa
,
Hikoe Enomoto
,
Ralph J. Faudree
,
Hao Li
,
Ingo Schiermeyer
Journal of Graph Theory
43
(3), 2003, pp. 188-198
Degree conditions for
k
-ordered Hamiltonian graphs
Ralph J. Faudree
,
Ronald J. Gould
,
Alexandr V. Kostochka
,
Linda Lesniak
,
Ingo Schiermeyer
,
Akira Saito
Journal of Graph Theory
42
(3), 2003, pp. 199-210
All cycle-complete graph Ramsey numbers
r(C_m,K_6)
Ingo Schiermeyer
Journal of Graph Theory
44
(4), 2003, pp. 251-260
Longest paths and longest cycles in graphs with large degree sums
Ingo Schiermeyer
,
Meike Tewes
Graphs and Combinatorics
18
(3), 2002, pp. 633-643
On a max-min problem concerning weights of edges
Stanislav Jendrol
,
Ingo Schiermeyer
Combinatorica
21
(3), 2001, pp. 351-359
Closure concepts: A survey
Hajo Broersma
,
Zdenȇk Ryjác̑ek
,
Ingo Schiermeyer
Graphs and Combinatorics
16
(1), 2000, pp. 17-48
Colouring graphs with prescribed induced cycle lengths
Ingo Schiermeyer
,
Bert Randerath
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 965-966
Approximating maximum independent set in
k
-clique-free graphs
Ingo Schiermeyer
Lecture Notes in Computer Science
1444
, 1998, pp. 159-168
Ramsey numbers
r(K_3,G)
for connected graphs
G
of order seven
Annette Schelten
,
Ingo Schiermeyer
Discrete Applied Mathematics
79
(1-3), 1997, pp. 189-200
Small cycles in Hamiltonian graphs
Uwe Schelten
,
Ingo Schiermeyer
Discrete Applied Mathematics
79
(1-3), 1997, pp. 201-211
An approximation algorithm for 3-colourability
Ingo Schiermeyer
Lecture Notes in Computer Science
1017
, 1995, pp. 146-151
Seiten 1
2
>