Ingo Schiermeyer

Citirano

	Sve	Od 2019.
Citati	3273	1064
H-indeks	32	16
i10-indeks	88	31

220

110

165

19951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202416 18 37 36 40 38 29 37 42 66 56 81 69 101 96 126 110 136 168 139 180 182 182 173 164 115 203 204 188 187

Javni pristup

Prikaži sve

15 članaka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Ralph FaudreeProvost, University of MemphisPotvrđena adresa e-pošte na memphis.edu
Trung Duy DoanHanoi University of Science and TechnologyPotvrđena adresa e-pošte na hust.edu.vn
Stanislav JendroľPotvrđena adresa e-pošte na upjs.sk
Hajo BroersmaFaculty EEMCS, University of Twente, NLPotvrđena adresa e-pošte na utwente.nl
Michael A. HenningProfessor of Mathematics, University of JohannesburgPotvrđena adresa e-pošte na uj.ac.za
Roman SotákAsociate Professor of Mathematics, P.J. Šafárik University in KošicePotvrđena adresa e-pošte na upjs.sk
Jan KatrenicComputer Science, Pavol Jozef Safarik University in KosicePotvrđena adresa e-pošte na upjs.sk
Zsolt TuzaMTA Rényi Institute, Budapest & University of Pannonia, VeszprémPotvrđena adresa e-pošte na dcs.uni-pannon.hu
Alexandr KostochkaPotvrđena adresa e-pošte na math.uiuc.edu
Guantao ChenGeorgia State University,Potvrđena adresa e-pošte na gsu.edu
Alewyn Petrus BurgerStellenbosch UniversityPotvrđena adresa e-pošte na sun.ac.za
Paul DorbecNormandie Univ, UNICAEN, ENSICAEN, CNRS, GREYC, 14000 Caen, FrancePotvrđena adresa e-pošte na unicaen.fr
Eric SopenaUniversité de BordeauxPotvrđena adresa e-pošte na labri.fr
Jan EksteinFakulta aplikovaných věd, Západočeská univerzita v PlzniPotvrđena adresa e-pošte na kma.zcu.cz
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaPotvrđena adresa e-pošte na kam.mff.cuni.cz
Peter DankelmannUniversity of JohannesburgPotvrđena adresa e-pošte na uj.ac.za
Ken-ichi KawarabayashiNational Institute of Informatics, The University of TokyoPotvrđena adresa e-pošte na nii.ac.jp
Van Bang LeUniversity of Rostock, GermanyPotvrđena adresa e-pošte na uni-rostock.de
Tkáč MichalPodnikovohospodárska fakulta KošicePotvrđena adresa e-pošte na euke.sk
Dieter RautenbachUlm University

Prati

Ingo Schiermeyer

Professor für angewandte diskrete Mathematik

Potvrđena adresa e-pošte na tu-freiberg.de

Diskrete Mathematik Algorithmik


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Vertex colouring and forbidden subgraphs–a survey B Randerath, I Schiermeyer Graphs and Combinatorics 20 (1), 1-40, 2004	174	2004
Reverse-fit: A 2-optimal algorithm for packing rectangles I Schiermeyer Algorithms—ESA'94: Second Annual European Symposium Utrecht, The …, 1994	153	1994
3-Colorability∈ P for P6-free graphs B Randerath, I Schiermeyer Discrete Applied Mathematics 136 (2-3), 299-313, 2004	101	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	96	2011
Rainbow numbers for matchings and complete graphs I Schiermeyer Discrete Mathematics 286 (1-2), 157-162, 2004	91	2004
Solving 3-satisfiability in less than 1, 579ⁿ steps I Schiermeyer Computer Science Logic: 6th Workshop, CSL'92 San Miniato, Italy, September …, 1993	90	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	77	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	76	1996
Exact algorithms for minimum dominating set B Randerath, I Schiermeyer Zentrum für Angewandte Informatik Köln, Lehrstuhl Speckenmeyer, Tech. Rep, 2004	71	2004
Three-colourability and forbidden subgraphs. II: polynomial algorithms B Randerath, I Schiermeyer, M Tewes Discrete mathematics 251 (1-3), 137-153, 2002	66	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	65	2001
Graphs with rainbow connection number two A Kemnitz, I Schiermeyer Discussiones Mathematicae Graph Theory 31 (2), 313-320, 2011	62	2011
Vertex pancyclic graphs B Randerath, I Schiermeyer, M Tewes, L Volkmann Discrete Applied Mathematics 120 (1-3), 219-237, 2002	54	2002
Closure concepts: a survey H Broersma, Z Ryjáček, I Schiermeyer Graphs and Combinatorics 16 (1), 17-48, 2000	52	2000
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
Gallai‐Ramsey number for H Liu, C Magnant, A Saito, I Schiermeyer, Y Shi Journal of Graph Theory 94 (2), 192-205, 2020	49	2020
On minimally rainbow k-connected graphs I Schiermeyer Discrete Applied Mathematics 161 (4-5), 702-705, 2013	43	2013
On the chromatic number of 2K2-free graphs C Brause, B Randerath, I Schiermeyer, E Vumar Discrete Applied Mathematics 253, 14-24, 2019	40	2019
Forbidden subgraphs and cycle extendability RJ Faudree, Z Ryjácek, I Schiermeyer JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING 19, 109-128, 1995	39	1995

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori