Ingo Schiermeyer

Citada per

	Totes	Des de 2020
Citacions	3382	984
Índex h	33	15
Índex i10	90	33

240

120

180

199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202516 19 38 38 40 39 29 37 43 65 56 82 72 100 99 130 110 140 168 139 180 179 185 179 159 118 207 196 185 237 39

Accés públic

Mostra-ho tot

15 articles

0 articles

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

Ralph FaudreeProvost, University of MemphisCorreu electrònic verificat a memphis.edu
Trung Duy DoanHanoi University of Science and TechnologyCorreu electrònic verificat a hust.edu.vn
Stanislav JendroľCorreu electrònic verificat a upjs.sk
Hajo BroersmaFaculty EEMCS, University of Twente, NLCorreu electrònic verificat a utwente.nl
Michael A. HenningProfessor of Mathematics, University of JohannesburgCorreu electrònic verificat a uj.ac.za
Roman SotákAsociate Professor of Mathematics, P.J. Šafárik University in KošiceCorreu electrònic verificat a upjs.sk
Jan KatrenicComputer Science, Pavol Jozef Safarik University in KosiceCorreu electrònic verificat a upjs.sk
Zsolt TuzaMTA Rényi Institute, Budapest & University of Pannonia, VeszprémCorreu electrònic verificat a dcs.uni-pannon.hu
Alexandr KostochkaCorreu electrònic verificat a math.uiuc.edu
Alewyn Petrus BurgerStellenbosch UniversityCorreu electrònic verificat a sun.ac.za
Guantao ChenGeorgia State University,Correu electrònic verificat a gsu.edu
Paul DorbecNormandie Univ, UNICAEN, ENSICAEN, CNRS, GREYC, 14000 Caen, FranceCorreu electrònic verificat a unicaen.fr
Eric SopenaUniversité de BordeauxCorreu electrònic verificat a labri.fr
Jan EksteinFakulta aplikovaných věd, Západočeská univerzita v PlzniCorreu electrònic verificat a kma.zcu.cz
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaCorreu electrònic verificat a kam.mff.cuni.cz
Peter DankelmannUniversity of JohannesburgCorreu electrònic verificat a uj.ac.za
Ken-ichi KawarabayashiNational Institute of Informatics, The University of TokyoCorreu electrònic verificat a nii.ac.jp
Van Bang LeUniversity of Rostock, GermanyCorreu electrònic verificat a uni-rostock.de
Tkáč MichalPodnikovohospodárska fakulta KošiceCorreu electrònic verificat a euke.sk
Dieter RautenbachUlm University

Segueix

Ingo Schiermeyer

Professor für angewandte diskrete Mathematik

Correu electrònic verificat a tu-freiberg.de

Diskrete Mathematik Algorithmik


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
Vertex colouring and forbidden subgraphs–a survey B Randerath, I Schiermeyer Graphs and Combinatorics 20 (1), 1-40, 2004	175	2004
Reverse-fit: A 2-optimal algorithm for packing rectangles I Schiermeyer Algorithms—ESA'94: Second Annual European Symposium Utrecht, The …, 1994	156	1994
3-Colorability∈ P for P6-free graphs B Randerath, I Schiermeyer Discrete Applied Mathematics 136 (2-3), 299-313, 2004	103	2004
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	100	2011
Rainbow numbers for matchings and complete graphs I Schiermeyer Discrete Mathematics 286 (1-2), 157-162, 2004	97	2004
Solving 3-satisfiability in less than 1, 579ⁿ steps I Schiermeyer Computer Science Logic: 6th Workshop, CSL'92 San Miniato, Italy, September …, 1993	94	1993
Rainbow connection in graphs with minimum degree three I Schiermeyer International Workshop on Combinatorial Algorithms, 432-437, 2009	87	2009
Polynomial -Binding Functions and Forbidden Induced Subgraphs: A Survey I Schiermeyer, B Randerath Graphs and Combinatorics 35 (1), 1-31, 2019	82	2019
Pure literal look ahead: an O (1.497^ n) 3-satisfiability algorithm I Schiermeyer Proc. Workshop on Satisfiability, Universita degli Studi, Siena, Italy, 1996, 1996	79	1996
Exact algorithms for minimum dominating set B Randerath, I Schiermeyer Zentrum für Angewandte Informatik Köln, Lehrstuhl Speckenmeyer, Tech. Rep, 2004	73	2004
Three-colourability and forbidden subgraphs. II: polynomial algorithms B Randerath, I Schiermeyer, M Tewes Discrete mathematics 251 (1-3), 137-153, 2002	69	2002
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	67	2001
Graphs with rainbow connection number two A Kemnitz, I Schiermeyer Discussiones Mathematicae Graph Theory 31 (2), 313-320, 2011	64	2011
Vertex pancyclic graphs B Randerath, I Schiermeyer, M Tewes, L Volkmann Discrete Applied Mathematics 120 (1-3), 219-237, 2002	58	2002
Closure concepts: a survey H Broersma, Z Ryjáček, I Schiermeyer Graphs and Combinatorics 16 (1), 17-48, 2000	54	2000
Gallai‐Ramsey number for H Liu, C Magnant, A Saito, I Schiermeyer, Y Shi Journal of Graph Theory 94 (2), 192-205, 2020	51	2020
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	51	2003
On minimally rainbow k-connected graphs I Schiermeyer Discrete Applied Mathematics 161 (4-5), 702-705, 2013	45	2013
Forbidden subgraphs and cycle extendability RJ Faudree, Z Ryjácek, I Schiermeyer JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING 19, 109-128, 1995	43	1995
On the chromatic number of 2K2-free graphs C Brause, B Randerath, I Schiermeyer, E Vumar Discrete Applied Mathematics 253, 14-24, 2019	41	2019

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors