EDBT 2026 Demo / reviewers in the wild / expert
Ingo Schiermeyer
dblp:s/IngoSchiermeyer
· DBLP profile ↗
30ranked-venue papers
10as first author
4since 2021 · last 2024
0000-0002-9226-8025ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 30 · 10 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | The proper 2-connection number of several graph classes
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer |
Discret. Appl. Math. | 3 |
| 2024 | Complete bipartite graphs without small rainbow subgraphs
Yaping Mao, Ingo Schiermeyer, Meiqin Wei |
Discret. Appl. Math. | 3 |
| 2022 | Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions
Christoph Brause, Maximilian Geißer, Ingo Schiermeyer |
Discret. Appl. Math. | 3 |
| 2022 | The proper 2-connection number and size of graphs
Trung Duy Doan, Ingo Schiermeyer |
Discret. Appl. Math. | 2 |
| 2020 | Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
Yaping Mao, Zhao Wang 0007, Colton Magnant, Ingo Schiermeyer |
Discret. Appl. Math. | 4 |
| 2019 | On the chromatic number of 2K2-free graphs
Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar |
Discret. Appl. Math. | 3 |
| 2019 | Maximum independent sets near the upper bound
Ingo Schiermeyer |
Discret. Appl. Math. | 1 |
| 2018 | On upper bounds for the independent transversal domination number
Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar |
Discret. Appl. Math. | 4 |
| 2016 | A lower bound on the independence number of a graph in terms of degrees and local clique sizes
Christoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer |
Discret. Appl. Math. | 4 |
| 2016 | Sufficient conditions for 2-rainbow connected graphs
Arnfried Kemnitz, Ingo Schiermeyer |
Discret. Appl. Math. | 2 |
| 2014 | Rainbow connection in oriented graphs
Paul Dorbec, Ingo Schiermeyer, Elzbieta Sidorowicz, Éric Sopena |
Discret. Appl. Math. | 2 |
| 2013 | On minimally rainbow k-connected graphs
Ingo Schiermeyer |
Discret. Appl. Math. | 1 |
| 2013 | Rainbow connection and minimum degree
Ingo Schiermeyer |
Discret. Appl. Math. | 1 |
| 2011 | Improved approximation bounds for the minimum rainbow subgraph problem
Ján Katrenic, Ingo Schiermeyer |
Inf. Process. Lett. | 2 |
| 2011 | On computing the minimum 3-path vertex cover and dissociation number of graphs
Frantisek Kardos, Ján Katrenic, Ingo Schiermeyer |
Theor. Comput. Sci. | 3 |
| 2010 | On maximum independent sets in P5-free graphs
Bert Randerath, Ingo Schiermeyer |
Discret. Appl. Math. | 2 |
| 2009 | Rainbow Connection in Graphs with Minimum Degree Three
Ingo Schiermeyer |
IWOCA | 1 |
| 2008 | Efficiency in exponential time for domination-type problems
Ingo Schiermeyer |
Discret. Appl. Math. | 1 |
| 2007 | On the complexity of 4-coloring graphs without long induced paths
Van Bang Le, Bert Randerath, Ingo Schiermeyer |
Theor. Comput. Sci. | 3 |
| 2004 | 3-Colorability in P for P6-free graphs
Bert Randerath, Ingo Schiermeyer |
Discret. Appl. Math. | 2 |
| 2002 | Vertex pancyclic graphs
Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann |
Discret. Appl. Math. | 2 |
| 1999 | Colouring Graphs with Prescribed Induced Cycle Lengths
Ingo Schiermeyer, Bert Randerath |
SODA | 1 |
| 1997 | Ramsey Numbers r(K3, G) for Connected Graphs G of Order Seven
Annette Schelten, Ingo Schiermeyer |
Discret. Appl. Math. | 2 |
| 1997 | Small Cycles in Hamiltonian Graphs
Uwe Schelten, Ingo Schiermeyer |
Discret. Appl. Math. | 2 |
| 1995 | An Approximation Algorithm for 3-Colourability
Ingo Schiermeyer |
WG | 1 |
| 1994 | Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles
Ingo Schiermeyer |
ESA | 1 |
| 1994 | Subgraphs, Closures and Hamiltonicity
Hajo Broersma, Ingo Schiermeyer |
Discret. Appl. Math. | 2 |
| 1994 | On Path-Tough GraphsabstractA graph G is called path-tough, if, for each nonempty set S of vertices, the graph $G - S$ can be covered by at most $|S|$ vertex disjoint paths. The authors prove that every graph of order n and minimum degree at least $[ 3/( 6 + \sqrt{3} ) ]n$ is Hamiltonian if and only if it is path-tough. Similar results involving the degree sum of two or three independent vertices, respectively, are given. Moreover, it is shown that every path-tough graph without three independent vertices of degree 2 contains a 2-factor. The authors also consider complexity aspects and prove that the decision problem of whether a given graph is path-tough is NP-complete. Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer |
SIAM J. Discret. Math. | 3 |
| 1993 | Deciding 3-Colourability in Less Than O(1.415^n) Steps
Ingo Schiermeyer |
WG | 1 |
| 1989 | A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph
Ingo Schiermeyer |
WG | 1 |