Gerhard Woeginger

Navedeno

	Vse	Od leta 2018
Navedbe	20184	5529
indeks h	75	34
indeks i10	275	147

1200

600

300

900

1995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202392 114 204 230 252 279 361 359 460 478 679 725 763 804 855 904 813 898 991 1028 960 985 969 980 915 986 1031 1147 464

Javni dostop

Prikaži vse

44 člankov

4 članki

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Vladimir Deineko, PhD, DScAssociate Professor (Reader) Warwick Business SchoolPreverjeni e-poštni naslov na wbs.ac.uk
Rainer E. BurkardProfessor emer. of Mathematics, TU GrazPreverjeni e-poštni naslov na opt.math.tu-graz.ac.at
Jiri SgallComputer Science Institute of Charles UniversityPreverjeni e-poštni naslov na iuuk.mff.cuni.cz
Janos CsirikProfessor of Computer Science, University of SzegedPreverjeni e-poštni naslov na inf.u-szeged.hu
Frits SpieksmaTU EindhovenPreverjeni e-poštni naslov na tue.nl
Amos FiatProfessor of Computer Science, Tel Aviv UniversityPreverjeni e-poštni naslov na tau.ac.il
Cor HurkensTU EindhovenPreverjeni e-poštni naslov na tue.nl
Hajo BroersmaFaculty EEMCS, University of Twente, NLPreverjeni e-poštni naslov na utwente.nl
Bo Chen, Ph.D., D.Sc., FAcSSChair of Operational Research & Management Science, University of WarwickPreverjeni e-poštni naslov na warwick.ac.uk
Fedor V. FominProfessor of Computer Science, University of BergenPreverjeni e-poštni naslov na uib.no
Han HoogeveenUniversiteit UtrechtPreverjeni e-poštni naslov na uu.nl
Robert BredereckTU ClausthalPreverjeni e-poštni naslov na tu-clausthal.de
Jiehua ChenTU ViennaPreverjeni e-poštni naslov na tuwien.ac.at
Leah EpsteinUniversity of HaifaPreverjeni e-poštni naslov na math.haifa.ac.il
Hans KellererUniversity of GrazPreverjeni e-poštni naslov na uni-graz.at
Gábor GalambosProfessor, University of SzegedPreverjeni e-poštni naslov na jgypk.szte.hu
Kirk PruhsProfessor of Computer Science, University of PittsburghPreverjeni e-poštni naslov na cs.pitt.edu
Ulrich PferschyUniversity of GrazPreverjeni e-poštni naslov na uni-graz.at
Jack van der VeenHoogleraar Supply Chain Management, NyenrodePreverjeni e-poštni naslov na nyenrode.nl
Pierluigi CrescenziProfessor of Computer Science, GSSI, L'Aquila, ItalyPreverjeni e-poštni naslov na gssi.it

Spremljaj

Gerhard Woeginger

Professor of Computer Science, RWTH Aachen

Preverjeni e-poštni naslov na cs.rwth-aachen.de

Theoretical Computer Science Discrete Mathematics Operations Research


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Online algorithms: The state of the art A Fiat, GJ Woeginger LNCS, Springer-Verlag 1442, 1998	2175*	1998
Exact algorithms for NP-hard problems: A survey GJ Woeginger Combinatorial optimization — Eureka, you shrink!, 185-207, 2003	939	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	756*	2000
A review of machine scheduling: Complexity, algorithms and approximability B Chen, CN Potts, GJ Woeginger Handbook of Combinatorial Optimization 3, 21-169, 1998	491*	1998
Computing and Software Science B Steffen, G Woeginger Springer Nature, LNCS 10000, 2019	456*	2019
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	264	2000
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	264*	1998
Approximation schemes for scheduling on parallel machines N Alon, Y Azar, GJ Woeginger, T Yadid Journal of Scheduling 1 (1), 55-66, 1998	237	1998
On-line packing and covering problems J Csirik, GJ Woeginger Online algorithms: the state of the art, 147-177, 2005	233	2005
A polynomial-time approximation scheme for maximizing the minimum machine completion time GJ Woeginger Operations Research Letters 20 (4), 149-154, 1997	215	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	214	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	210	2001
Almost tight bounds for ɛ-Nets J Komlós, J Pach, G Woeginger Discrete & Computational Geometry 7 (1), 163-173, 1992	184	1992
An axiomatic characterization of the Hirsch-index GJ Woeginger Mathematical Social Sciences 56 (2), 224-232, 2008	183	2008
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	178	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	172	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	167	2004
Dagstuhl seminar June 1996 on online algorithms A Fiat, G Woeginger Dagstuhl Seminar Report, 1996	160*	1996
On-line scheduling of jobs with fixed start and end times GJ Woeginger Theoretical Computer Science 130 (1), 5-16, 1994	160	1994

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