Gerhard Woeginger

Citirano

	Sve	Od 2018.
Citati	19775	5150
H-indeks	74	32
i10-indeks	271	138

1200

600

300

900

1995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202394 115 203 231 249 279 359 359 459 475 677 724 760 805 856 902 811 891 987 1027 961 984 970 978 904 975 1021 1165 103

Javni pristup

Prikaži sve

44 članka

4 članka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Vladimir Deineko, PhD, DScAssociate Professor (Reader) Warwick Business SchoolPotvrđena adresa e-pošte na wbs.ac.uk
Rainer E. BurkardProfessor emer. of Mathematics, TU GrazPotvrđena adresa e-pošte na opt.math.tu-graz.ac.at
Jiri SgallComputer Science Institute of Charles UniversityPotvrđena adresa e-pošte na iuuk.mff.cuni.cz
Janos CsirikProfessor of Computer Science, University of SzegedPotvrđena adresa e-pošte na inf.u-szeged.hu
Frits SpieksmaTU EindhovenPotvrđena adresa e-pošte na tue.nl
Cor HurkensTU EindhovenPotvrđena adresa e-pošte na tue.nl
Amos FiatProfessor of Computer Science, Tel Aviv UniversityPotvrđena adresa e-pošte na tau.ac.il
Hajo BroersmaFaculty EEMCS, University of Twente, NLPotvrđena adresa e-pošte na utwente.nl
Bo Chen, Ph.D., D.Sc., FAcSSChair of Operational Research & Management Science, University of WarwickPotvrđena adresa e-pošte na warwick.ac.uk
Fedor V. FominProfessor of Computer Science, University of BergenPotvrđena adresa e-pošte na uib.no
Han HoogeveenUniversiteit UtrechtPotvrđena adresa e-pošte na uu.nl
Robert BredereckTU ClausthalPotvrđena adresa e-pošte na tu-clausthal.de
Jiehua ChenTU ViennaPotvrđena adresa e-pošte na tuwien.ac.at
Leah EpsteinUniversity of HaifaPotvrđena adresa e-pošte na math.haifa.ac.il
Hans KellererUniversity of GrazPotvrđena adresa e-pošte na uni-graz.at
Gábor GalambosProfessor, University of SzegedPotvrđena adresa e-pošte na jgypk.szte.hu
Kirk PruhsProfessor of Computer Science, University of PittsburghPotvrđena adresa e-pošte na cs.pitt.edu
Ulrich PferschyUniversity of GrazPotvrđena adresa e-pošte na uni-graz.at
Jack van der VeenHoogleraar Supply Chain Management, NyenrodePotvrđena adresa e-pošte na nyenrode.nl
Pierluigi CrescenziProfessor of Computer Science, GSSI, L'Aquila, ItalyPotvrđena adresa e-pošte na gssi.it

Prati

Gerhard Woeginger

Professor of Computer Science, RWTH Aachen

Potvrđena adresa e-pošte na cs.rwth-aachen.de

Theoretical Computer Science Discrete Mathematics Operations Research


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Online algorithms: The state of the art A Fiat, GJ Woeginger LNCS, Springer-Verlag 1442, 1998	2150*	1998
Exact algorithms for NP-hard problems: A survey GJ Woeginger Combinatorial optimization — Eureka, you shrink!, 185-207, 2003	914	2003
A compendium of NP optimization problems P Crescenzi, V Kann, MM Halldórsson, M Karpinski, GJ Woeginger URL http://www.nada.kth.se/~viggo/problemlist/compendium.html, 2000	753*	2000
A review of machine scheduling: Complexity, algorithms and approximability B Chen, CN Potts, GJ Woeginger Handbook of Combinatorial Optimization 3, 21-169, 1998	484*	1998
Computing and Software Science B Steffen, G Woeginger Springer Nature, LNCS 10000, 2019	413*	2019
Well-solvable special cases of the traveling salesman problem: a survey RE Burkard, VG Deineko, R van Dal, JAA van der Veen, GJ Woeginger SIAM Review 40 (3), 496-546, 1998	261*	1998
When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? GJ Woeginger INFORMS Journal on Computing 12 (1), 57-74, 2000	258	2000
Approximation schemes for scheduling on parallel machines N Alon, Y Azar, GJ Woeginger, T Yadid Journal of Scheduling 1 (1), 55-66, 1998	232	1998
On-line packing and covering problems J Csirik, GJ Woeginger Online algorithms: the state of the art, 147-177, 2005	229	2005
A polynomial-time approximation scheme for maximizing the minimum machine completion time GJ Woeginger Operations Research Letters 20 (4), 149-154, 1997	209	1997
Uncapacitated single and multiple allocation p-hub center problems AT Ernst, H Hamacher, H Jiang, M Krishnamoorthy, G Woeginger Computers & Operations Research 36 (7), 2230-2241, 2009	207	2009
Complexity of coloring graphs without forbidden induced subgraphs D Král’, J Kratochvíl, Z Tuza, GJ Woeginger Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG …, 2001	207	2001
An axiomatic characterization of the Hirsch-index GJ Woeginger Mathematical Social Sciences 56 (2), 224-232, 2008	182	2008
Almost tight bounds for ɛ-Nets J Komlós, J Pach, G Woeginger Discrete & Computational Geometry 7 (1), 163-173, 1992	182	1992
Approximability and nonapproximability results for minimizing total flow time on a single machine H Kellerer, T Tautenhahn, GJ Woeginger Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing …, 1996	177	1996
Getting the best response for your erg K Pruhs, P Uthaisombut, G Woeginger ACM Transactions on Algorithms (TALG) 4 (3), 1-17, 2008	172*	2008
Polynomial time approximation algorithms for machine scheduling: Ten open problems P Schuurman, GJ Woeginger Journal of Scheduling 2 (5), 203-213, 1999	170	1999
Exact (exponential) algorithms for the dominating set problem FV Fomin, D Kratsch, GJ Woeginger Graph-Theoretic Concepts in Computer Science (WG) 3353, 245-256, 2004	166	2004
On-line scheduling of jobs with fixed start and end times GJ Woeginger Theoretical Computer Science 130 (1), 5-16, 1994	158	1994
Dagstuhl seminar June 1996 on online algorithms A Fiat, G Woeginger Dagstuhl Seminar Report, 1996	157*	1996

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