Ingo Schiermeyer

162 papers A* 1A 1B 4C 2Journal 151Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Bounds for irredundant and CO-irredundant Ramsey numbers.
Discuss. Math. Graph Theory
Meng Ji, Yaping Mao, Ingo Schiermeyer
2026 J jnl
On k-colorability of (bull,H)-free graphs.
Discret. Math.
Nadzieja Hodur, Monika Pilsniak, Magdalena Prorok, Ingo Schiermeyer
2024 J jnl
Compatible Spanning Circuits and Forbidden Induced Subgraphs.
Graphs Comb.
Zhiwei Guo, Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
2024 J jnl
Complete bipartite graphs without small rainbow subgraphs.
Discret. Appl. Math.
Zhiqiang Ma, Yaping Mao, Ingo Schiermeyer, Meiqin Wei
2024 J jnl
Gallai-Ramsey Numbers for Paths.
Graphs Comb.
Ping Li, Yaping Mao, Ingo Schiermeyer, Yifan Yao
2024 J jnl
Graphs with large (1,2)-rainbow connection numbers.
Appl. Math. Comput.
Trung Duy Doan, Thi Thanh Chau Do, Ingo Schiermeyer
2024 J jnl
The conflict-free connection number and the minimum degree-sum of graphs.
Appl. Math. Comput.
Trung Duy Doan, Thi Thanh Chau Do, Pham Hoang Ha, Ngoc Diep Pham, Ingo Schiermeyer
2024 J jnl
The proper 2-connection number of several graph classes.
Discret. Appl. Math.
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
2023 J jnl
Gallai-Ramsey numbers for fans.
Discret. Math.
Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer
2023 J jnl
Loose Edge-Connection of Graphs.
Graphs Comb.
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
2022 J jnl
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4.
Discret. Math.
Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
2022 J jnl
Gallai-Ramsey number for K 5 ${K}_{5}$.
J. Graph Theory
Colton Magnant, Ingo Schiermeyer
2022 J jnl
Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions.
Discret. Appl. Math.
Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
2022 J jnl
Ramsey and Gallai-Ramsey Number for Wheels.
Graphs Comb.
Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer
2022 J jnl
The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs.
Graphs Comb.
Trung Duy Doan, Pham Hoang Ha, Ingo Schiermeyer
2022 J jnl
The proper 2-connection number and size of graphs.
Discret. Appl. Math.
Trung Duy Doan, Ingo Schiermeyer
2021 J jnl
Conflict-Free Connection Number and Size of Graphs.
Graphs Comb.
Trung Duy Doan, Ingo Schiermeyer
2021 J jnl
Conflict-free vertex connection number at most 3 and size of graphs.
Discuss. Math. Graph Theory
Trung Duy Doan, Ingo Schiermeyer
2021 J jnl
From Colourful to Rainbow Paths in Graphs: Colouring the Vertices.
Graphs Comb.
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
2021 J jnl
Proper rainbow connection number of graphs.
Discuss. Math. Graph Theory
Trung Duy Doan, Ingo Schiermeyer
2020 J jnl
Gallai-Ramsey number for K 4.
J. Graph Theory
Henry Liu, Colton Magnant, Akira Saito, Ingo Schiermeyer, Yongtang Shi
2020 J jnl
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges.
Discret. Appl. Math.
Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer
2019 J jnl
Maximum independent sets near the upper bound.
Discret. Appl. Math.
Ingo Schiermeyer
2019 J jnl
On forbidden induced subgraphs for K1, 3-free perfect graphs.
Discret. Math.
Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
2019 J jnl
On the chromatic number of 2K2-free graphs.
Discret. Appl. Math.
Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar
2019 J jnl
Polynomial χ -Binding Functions and Forbidden Induced Subgraphs: A Survey.
Graphs Comb.
Ingo Schiermeyer, Bert Randerath
2018 J jnl
Graphs with Conflict-Free Connection Number Two.
Graphs Comb.
Hong Chang, Trung Duy Doan, Zhong Huang, Stanislav Jendrol', Xueliang Li, Ingo Schiermeyer
2018 J jnl
Odd connection and odd vertex-connection of graphs.
Discret. Math.
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
2018 J jnl
On upper bounds for the independent transversal domination number.
Discret. Appl. Math.
Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar
2017 J jnl
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability.
Discret. Math.
Christoph Brause, Dieter Rautenbach, Ingo Schiermeyer
2017 J jnl
Minimum Degree Conditions for the Proper Connection Number of Graphs.
Graphs Comb.
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
2017 J jnl
On sequential heurestic methods for the maximum independent set problem.
Discuss. Math. Graph Theory
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer
2017 J jnl
Proper connection and size of graphs.
Discret. Math.
Susan A. van Aardt, Christoph Brause, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer
2016 J jnl
A lower bound on the independence number of a graph in terms of degrees and local clique sizes.
Discret. Appl. Math.
Christoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer
2016 J jnl
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2.
Discret. Math.
Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
2016 J jnl
Chromatic number of P
Discret. Math.
Ingo Schiermeyer
2016 J jnl
Dense arbitrarily partitionable graphs.
Discuss. Math. Graph Theory
Rafal Kalinowski, Monika Pilsniak, Ingo Schiermeyer, Mariusz Wozniak
2016 J jnl
Kernelization of the 3-path vertex cover problem.
Discret. Math.
Christoph Brause, Ingo Schiermeyer
2016 J jnl
On Star-Wheel Ramsey Numbers.
Graphs Comb.
Binlong Li, Ingo Schiermeyer
2016 J jnl
On the Maximum Weight of a Sparse Connected Graph of Given Order and Size.
Graphs Comb.
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer
2016 J jnl
On the chromatic number of (P
Electron. Notes Discret. Math.
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
2016 J jnl
On the maximum weight of a dense connected graph of given order and size.
Discret. Math.
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer
2016 J jnl
On the minimum degree and the proper connection number of graphs.
Electron. Notes Discret. Math.
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
2016 J jnl
Proper connection number 2, connectivity, and forbidden subgraphs.
Electron. Notes Discret. Math.
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
2016 J jnl
Sufficient conditions for 2-rainbow connected graphs.
Discret. Appl. Math.
Arnfried Kemnitz, Ingo Schiermeyer
2015 J jnl
4-colorability of P
Electron. Notes Discret. Math.
Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána, Rastislav Krivos-Bellus
2015 J jnl
Extending the Max Algorithm for maximum independent set.
Discuss. Math. Graph Theory
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer
2015 J jnl
Graphs with 3-rainbow index
Discuss. Math. Graph Theory
Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao
2015 J jnl
Graphs with 4-rainbow index 3 and
Discuss. Math. Graph Theory
Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao
2015 J jnl
Hypohamiltonian Oriented Graphs of All Possible Orders.
Graphs Comb.
Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer
2015 J jnl
New sufficient conditions for α-redundant vertices.
Discret. Math.
Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer
2015 J jnl
On forbidden subgraphs and rainbow connection in graphs with minimum degree 2.
Discret. Math.
Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer
2015 J jnl
Rainbow Numbers for Cycles in Plane Triangulations.
J. Graph Theory
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer, Roman Soták
2015 J jnl
Rainbow Numbers for Graphs Containing Small Cycles.
Graphs Comb.
Ingo Schiermeyer, Roman Soták
2015 J jnl
Rainbow connection and forbidden subgraphs.
Discret. Math.
Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
2015 J jnl
The Maximum Independent Set Problem in Subclasses of S
Electron. Notes Discret. Math.
Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer
2015 J jnl
The Maximum Independent Set Problem in Subclasses of Subcubic Graphs.
Discret. Math.
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer
2014 J jnl
Rainbow connection in oriented graphs.
Discret. Appl. Math.
Paul Dorbec, Ingo Schiermeyer, Elzbieta Sidorowicz, Éric Sopena
2014 J jnl
Rainbow numbers for matchings in plane triangulations.
Discret. Math.
Stanislav Jendrol', Ingo Schiermeyer, Jianhua Tu
2013 J jnl
On maximum weight of a bipartite graph of given order and size.
Discuss. Math. Graph Theory
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer
2013 J jnl
On minimally rainbow
Discret. Appl. Math.
Ingo Schiermeyer
2013 J jnl
On the minimum rainbow subgraph number of a graph.
Ars Math. Contemp.
Ingo Schiermeyer
2013 J jnl
Rainbow connection and minimum degree.
Discret. Appl. Math.
Ingo Schiermeyer
2013 J jnl
Rainbow connection in sparse graphs.
Discuss. Math. Graph Theory
Arnfried Kemnitz, Jakub Przybylo, Ingo Schiermeyer, Mariusz Wozniak
2013 J jnl
Rainbow connection number of dense graphs.
Discuss. Math. Graph Theory
Xueliang Li, Mengmeng Liu, Ingo Schiermeyer
2013 J jnl
The rainbow connection number of 2-connected graphs.
Discret. Math.
Jan Ekstein, Premysl Holub, Tomás Kaiser, Maria Koch, Stephan Matos Camacho, Zdenek Ryjácek, Ingo Schiermeyer
2012 J jnl
A Dirac theorem for trestles.
Discret. Math.
Stanislav Jendrol', Tomás Kaiser, Zdenek Ryjácek, Ingo Schiermeyer
2012 J jnl
Closures, cycles, and paths.
J. Graph Theory
Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer
2012 J jnl
Dense Arbitrarily Vertex Decomposable Graphs.
Graphs Comb.
Mirko Hornák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak
2012 J jnl
Improved degree conditions for Hamiltonian properties.
Discret. Math.
Arnfried Kemnitz, Ingo Schiermeyer
2011 J jnl
A New Bound on the Domination Number of Graphs with Minimum Degree Two.
Electron. J. Comb.
Michael A. Henning, Ingo Schiermeyer, Anders Yeo
2011 J jnl
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity.
Comb.
Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer
2011 J jnl
Algorithmic approaches for the minimum rainbow subgraph problem.
Electron. Notes Discret. Math.
Maria Koch, Stephan Matos Camacho, Ingo Schiermeyer
2011 J jnl
Bounds for the rainbow connection number of graphs.
Discuss. Math. Graph Theory
Ingo Schiermeyer
2011 J jnl
Closure for spanning trees and distant area.
Discuss. Math. Graph Theory
Jun Fujisawa, Akira Saito, Ingo Schiermeyer
2011 J jnl
Graphs with rainbow connection number two.
Discuss. Math. Graph Theory
Arnfried Kemnitz, Ingo Schiermeyer
2011 J jnl
Improved approximation bounds for the minimum rainbow subgraph problem.
Inf. Process. Lett.
Ján Katrenic, Ingo Schiermeyer
2011 J jnl
On computing the minimum 3-path vertex cover and dissociation number of graphs.
Theor. Comput. Sci.
Frantisek Kardos, Ján Katrenic, Ingo Schiermeyer
2010 J jnl
Approximation algorithms for the minimum rainbow subgraph problem.
Discret. Math.
Stephan Matos Camacho, Ingo Schiermeyer, Zsolt Tuza
2010 J jnl
Cycle length parities and the chromatic number.
J. Graph Theory
Christian Löwenstein, Dieter Rautenbach, Ingo Schiermeyer
2010 J jnl
On maximum independent sets in P
Discret. Appl. Math.
Bert Randerath, Ingo Schiermeyer
2010 J jnl
Packing disjoint cycles over vertex cuts.
Discret. Math.
Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel
2010 C conf
Progress on Rainbow Connection.
CTW
Ingo Schiermeyer
2010 J jnl
Random Procedures for Dominating Sets in Graphs.
Electron. J. Comb.
Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
2010 J jnl
Some results on Reed's Conjecture about omega, Delta, and chi with respect to alpha.
Discret. Math.
Anja Kohl, Ingo Schiermeyer
2010 J jnl
Structural Properties and Hamiltonicity of Neighborhood Graphs.
Graphs Comb.
Ingo Schiermeyer, Martin Sonntag, Hanns-Martin Teichert
2009 J jnl
A Rainbow k-Matching in the Complete Graph with r Colors.
Electron. J. Comb.
Shinya Fujita, Atsushi Kaneko, Ingo Schiermeyer, Kazuhiro Suzuki
2009 J jnl
Colourings of graphs with two consecutive odd cycle lengths.
Discret. Math.
Stephan Matos Camacho, Ingo Schiermeyer
2009 J jnl
On
Discuss. Math. Graph Theory
Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
2009 J jnl
On the circumference of a graph and its complement.
Discret. Math.
Ralph J. Faudree, Linda M. Lesniak, Ingo Schiermeyer
2009 C conf
Rainbow Connection in Graphs with Minimum Degree Three.
IWOCA
Ingo Schiermeyer
2008 J jnl
Efficiency in exponential time for domination-type problems.
Discret. Appl. Math.
Ingo Schiermeyer
2008 J jnl
Non-path spectrum sets.
J. Graph Theory
Guantao Chen, Ralph J. Faudree, Xuechao Li, Ingo Schiermeyer
2008 J jnl
The independence number in graphs of maximum degree three.
Discret. Math.
Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer
2007 J jnl
A new upper bound for the chromatic number of a graph.
Discuss. Math. Graph Theory
Ingo Schiermeyer
2007 J jnl
Chvátal Erdós condition and 2-factors with a specyfied number of components.
Discuss. Math. Graph Theory
Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer
2007 J jnl
Degree conditions for hamiltonicity: Counting the number of missing edges.
Discret. Math.
Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer
2007 J jnl
Independence number and vertex-disjoint cycles.
Discret. Math.
Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol', Katsuhiro Ota, Ingo Schiermeyer
2007 J jnl
New sufficient conditions for hamiltonian and pancyclic graphs.
Discuss. Math. Graph Theory
Ingo Schiermeyer, Mariusz Wozniak
2007 J jnl
On the complexity of 4-coloring graphs without long induced paths.
Theor. Comput. Sci.
Van Bang Le, Bert Randerath, Ingo Schiermeyer
2007 J jnl
Rainbows in the Hypercube.
Graphs Comb.
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz, Meinhard Möller, Ingo Schiermeyer
2006 J jnl
A lower bound on the independence number of a graph in terms of degrees.
Discuss. Math. Graph Theory
Jochen Harant, Ingo Schiermeyer
2006 J jnl
Chvátal-Erdös condition and pancyclism.
Discuss. Math. Graph Theory
Evelyne Flandrin, Hao Li, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak
2006 J jnl
Extremal Problems for Imbalanced Edges.
Graphs Comb.
Dieter Rautenbach, Ingo Schiermeyer
2006 J jnl
Upper bounds for the chromatic number of a graph.
Electron. Notes Discret. Math.
Ingo Schiermeyer
2005 J jnl
An Asymptotic Result for the Path Partition Conjecture.
Electron. J. Comb.
Marietjie Frick, Ingo Schiermeyer
2005 J jnl
Ramsey (K
Electron. J. Comb.
Mieczyslaw Borowiecki, Ingo Schiermeyer, Elzbieta Sidorowicz
2005 J jnl
The Cycle-Complete Graph Ramsey Number r
Discuss. Math. Graph Theory
Ingo Schiermeyer
2004 J jnl
3-Colorability in P for P
Discret. Appl. Math.
Bert Randerath, Ingo Schiermeyer
2004 J jnl
Cycle lengths and chromatic number of graphs.
Discret. Math.
Peter Mihók, Ingo Schiermeyer
2004 J jnl
Rainbow numbers for matchings and complete graphs.
Discret. Math.
Ingo Schiermeyer
2004 J jnl
Vertex Colouring and Forbidden Subgraphs - A Survey.
Graphs Comb.
Bert Randerath, Ingo Schiermeyer
2003 J jnl
0-Dual Closures for Several Classes of Graphs.
Graphs Comb.
Ahmed Ainouche, Ingo Schiermeyer
2003 J jnl
All cycle-complete graph Ramsey numbers
J. Graph Theory
Ingo Schiermeyer
2003 J jnl
Degree conditions for
J. Graph Theory
Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito
2003 J jnl
The Ramsey number r(C
Discuss. Math. Graph Theory
Ralph J. Faudree, Annette Schelten, Ingo Schiermeyer
2003 J jnl
Two-factors each component of which contains a specified vertex.
J. Graph Theory
Yoshimi Egawa, Hikoe Enomoto, Ralph J. Faudree, Hao Li, Ingo Schiermeyer
2002 J jnl
A note on Brooks' theorem for triangle-free graphs.
Australas. J Comb.
Bert Randerath, Ingo Schiermeyer
2002 J jnl
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.
Discret. Math.
Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer
2002 J jnl
Longest Paths and Longest Cycles in Graphs with Large Degree Sums.
Graphs Comb.
Ingo Schiermeyer, Meike Tewes
2002 J jnl
Preface.
Discuss. Math. Graph Theory
Jochen Harant, Ingo Schiermeyer, Margit Voigt
2002 J jnl
Three-colourability and forbidden subgraphs. II: polynomial algorithms.
Discret. Math.
Bert Randerath, Ingo Schiermeyer, Meike Tewes
2002 J jnl
Vertex pancyclic graphs.
Discret. Appl. Math.
Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann
2001 J jnl
3-Colorability element oF P for p
Electron. Notes Discret. Math.
Bert Randerath, Ingo Schiermeyer
2001 J jnl
Colouring Graphs with Prescribed Induced Cycle Lengths.
Discuss. Math. Graph Theory
Bert Randerath, Ingo Schiermeyer
2001 J jnl
On a Max-min Problem Concerning Weights of Edges.
Comb.
Stanislav Jendrol', Ingo Schiermeyer
2001 J jnl
On the independence number of a graph in terms of order and size.
Discret. Math.
Jochen Harant, Ingo Schiermeyer
2001 J jnl
On the stability for pancyclicity.
Discuss. Math. Graph Theory
Ingo Schiermeyer
2001 J jnl
On weights of induced paths and cycles in claw-free and
J. Graph Theory
Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer
2000 J jnl
Closure Concepts: A Survey.
Graphs Comb.
Hajo Broersma, Zdenek Ryjácek, Ingo Schiermeyer
2000 J jnl
On-line rankings of graphs.
Discret. Math.
Ingo Schiermeyer, Zsolt Tuza, Margit Voigt
1999 J jnl
3-colored Ramsey Numbers of Odd Cycles.
Electron. Notes Discret. Math.
Annette Schelten, Ingo Schiermeyer, Ralph J. Faudree
1999 A* conf
Colouring Graphs with Prescribed Induced Cycle Lengths.
SODA
Ingo Schiermeyer, Bert Randerath
1999 J jnl
Forbidden subgraphs, stability and hamiltonicity.
Discret. Math.
Jan Brousek, Zdenek Ryjácek, Ingo Schiermeyer
1999 — ch.
Linear und exponentiell wachsende Kaninchenpopulationen.
Angewandte Mathematik, insbesondere Informatik
Ingo Schiermeyer
1999 J jnl
On quadrilaterals in a graph.
Discret. Math.
Bert Randerath, Ingo Schiermeyer, Hong Wang
1999 J jnl
Vertex Pancyclic Graphs.
Electron. Notes Discret. Math.
Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes
1998 J jnl
2-factors and hamiltonicity.
Discret. Math.
Zdenek Ryjácek, Ingo Schiermeyer
1998 J jnl
A planarity criterion for cubic bipartite graphs.
Discret. Math.
Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer
1998 — conf
Approximating Maximum Independent Set in
APPROX
Ingo Schiermeyer
1998 J jnl
Ramsey numbers r(K
Discret. Math.
Annette Schelten, Ingo Schiermeyer
1997 J jnl
Dirac's minimum degree condition restricted to claws.
Discret. Math.
Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer
1997 J jnl
Local connectivity and cycle xtension in claw-free graphs.
Ars Comb.
Ralph J. Faudree, Zdenek Ryjácek, Ingo Schiermeyer
1997 J jnl
On the computational complexity of (O, P)-partition problems.
Discuss. Math. Graph Theory
Jan Kratochvíl, Ingo Schiermeyer
1997 J jnl
Ramsey Numbers r(K
Discret. Appl. Math.
Annette Schelten, Ingo Schiermeyer
1997 J jnl
Small Cycles in Hamiltonian Graphs.
Discret. Appl. Math.
Uwe Schelten, Ingo Schiermeyer
1996 J jnl
Toughness and hamiltonicity in almost claw-free graphs.
J. Graph Theory
Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer
1995 B conf
An Approximation Algorithm for 3-Colourability.
WG
Ingo Schiermeyer
1995 J jnl
Insertible vertices, neighborhood intersections, and hamiltonicity.
J. Graph Theory
Ahmed Ainouche, Ingo Schiermeyer
1995 J jnl
On the independence number in K
Discret. Math.
Zdenek Ryjácek, Ingo Schiermeyer
1995 J jnl
Problems remaining NP-complette for sparse or dense graphs.
Discuss. Math. Graph Theory
Ingo Schiermeyer
1995 J jnl
The flower conjecture in special classes of graphs.
Discuss. Math. Graph Theory
Zdenek Ryjácek, Ingo Schiermeyer
1994 J jnl
A closure concept based on neighborhood unions of independent triples.
Discret. Math.
Haitze J. Broersma, Ingo Schiermeyer
1994 J jnl
On Path-Tough Graphs.
SIAM J. Discret. Math.
Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer
1994 A conf
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles.
ESA
Ingo Schiermeyer
1994 J jnl
Subgraphs, Closures and Hamiltonicity.
Discret. Appl. Math.
Hajo Broersma, Ingo Schiermeyer
1994 J jnl
The k-Satisfiability problem remains NP-complete for dense families.
Discret. Math.
Ingo Schiermeyer
1993 J jnl
Computation of the 0-dual closure for hamiltonian graphs.
Discret. Math.
Ingo Schiermeyer
1993 B conf
Deciding 3-Colourability in Less Than O(1.415^n) Steps.
WG
Ingo Schiermeyer
1992 B conf
Solving 3-Satisfiability in Less Then 1, 579
CSL
Ingo Schiermeyer
1989 B conf
A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph.
WG
Ingo Schiermeyer
1988 — —
Algorithmen zum Auffinden längster Kreise in Graphen.
Ingo Schiermeyer