Ingo Schiermeyer

Navedeno

	Vse	Od leta 2018
Navedbe	2922	906
indeks h	29	16
indeks i10	81	28

220

110

165

1995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202316 14 38 36 40 41 26 38 44 64 57 78 70 99 92 125 114 131 175 139 173 183 182 171 158 115 202 215 43

Javni dostop

Prikaži vse

12 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Ralph FaudreeProvost, University of MemphisPreverjeni e-poštni naslov na memphis.edu
Stanislav JendroľPreverjeni e-poštni naslov na upjs.sk
Trung Duy DoanHanoi University of Science and TechnologyPreverjeni e-poštni naslov na hust.edu.vn
Hajo BroersmaFaculty EEMCS, University of Twente, NLPreverjeni e-poštni naslov na utwente.nl
Michael A. HenningProfessor of Mathematics, University of JohannesburgPreverjeni e-poštni naslov na uj.ac.za
Jan KatrenicComputer Science, Pavol Jozef Safarik University in KosicePreverjeni e-poštni naslov na upjs.sk
Zsolt TuzaMTA Rényi Institute, Budapest & University of Pannonia, VeszprémPreverjeni e-poštni naslov na dcs.uni-pannon.hu
Roman SotákAsociate Professor of Mathematics, P.J. Šafárik University in KošicePreverjeni e-poštni naslov na upjs.sk
Alexandr KostochkaPreverjeni e-poštni naslov na math.uiuc.edu
Guantao ChenGeorgia State University,Preverjeni e-poštni naslov na gsu.edu
Alewyn Petrus BurgerStellenbosch UniversityPreverjeni e-poštni naslov na sun.ac.za
Paul DorbecNormandie Univ, UNICAEN, ENSICAEN, CNRS, GREYC, 14000 Caen, FrancePreverjeni e-poštni naslov na unicaen.fr
Eric SopenaUniversité de BordeauxPreverjeni e-poštni naslov na labri.fr
Jan EksteinFakulta aplikovaných věd, Západočeská univerzita v PlzniPreverjeni e-poštni naslov na kma.zcu.cz
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaPreverjeni e-poštni naslov na kam.mff.cuni.cz
Peter DankelmannUniversity of JohannesburgPreverjeni e-poštni naslov na uj.ac.za
Ken-ichi KawarabayashiNational Institute of InformaticsPreverjeni e-poštni naslov na nii.ac.jp
Van Bang LeUniversity of Rostock, GermanyPreverjeni e-poštni naslov na uni-rostock.de
Tkáč MichalPodnikovohospodárska fakulta KošicePreverjeni e-poštni naslov na euke.sk
Dieter RautenbachUlm University

Spremljaj

Ingo Schiermeyer

Professor für angewandte diskrete Mathematik

Preverjeni e-poštni naslov na tu-freiberg.de

Diskrete Mathematik Algorithmik


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Vertex colouring and forbidden subgraphs–a survey B Randerath, I Schiermeyer Graphs and Combinatorics 20 (1), 1-40, 2004	149	2004
Reverse-fit: A 2-optimal algorithm for packing rectangles I Schiermeyer Algorithms—ESA'94: Second Annual European Symposium Utrecht, The …, 1994	149	1994
3-Colorability∈ P for P6-free graphs B Randerath, I Schiermeyer Discrete Applied Mathematics 136 (2-3), 299-313, 2004	96	2004
Solving 3-satisfiability in less than 1, 579ⁿ steps I Schiermeyer Computer Science Logic: 6th Workshop, CSL'92 San Miniato, Italy, September …, 1993	91	1993
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	89	2011
Rainbow connection in graphs with minimum degree three I Schiermeyer Combinatorial Algorithms 5874, 432-437, 2009	85	2009
Rainbow numbers for matchings and complete graphs I Schiermeyer Discrete Mathematics 286 (1-2), 157-162, 2004	77	2004
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	69	2004
Three-colourability and forbidden subgraphs. II: polynomial algorithms B Randerath, I Schiermeyer, M Tewes Discrete mathematics 251 (1-3), 137-153, 2002	63	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	60	2001
Graphs with rainbow connection number two A Kemnitz, I Schiermeyer Discussiones Mathematicae Graph Theory 31 (2), 313-320, 2011	58	2011
Vertex pancyclic graphs B Randerath, I Schiermeyer, M Tewes, L Volkmann Discrete Applied Mathematics 120 (1-3), 219-237, 2002	50	2002
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	49	2003
Closure concepts: a survey H Broersma, Z Ryjáček, I Schiermeyer Graphs and Combinatorics 16 (1), 17-48, 2000	48	2000
Polynomial -Binding Functions and Forbidden Induced Subgraphs: A Survey I Schiermeyer, B Randerath Graphs and Combinatorics 35 (1), 1-31, 2019	45	2019
On minimally rainbow k-connected graphs I Schiermeyer Discrete Applied Mathematics 161 (4-5), 702-705, 2013	42	2013
Gallai‐Ramsey number for H Liu, C Magnant, A Saito, I Schiermeyer, Y Shi Journal of Graph Theory 94 (2), 192-205, 2020	40	2020
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
On the complexity of 4-coloring graphs without long induced paths B Randerath, I Schiermeyer Theoretical Computer Science 389 (1-2), 330-335, 2007	36	2007

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji