Gerhard Woeginger

Cituota

	Visi	Nuo 2019
Šaltiniai	21884	6121
h-rodyklė	78	33
i10-rodyklė	288	154

1200

600

300

900

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202457 101 111 213 233 263 307 355 373 473 473 666 723 774 797 853 907 827 905 993 1025 961 984 964 991 940 983 1029 1113 1027 1021

Viešas pasiekiamumas

Peržiūrėti viską

47 straipsniai

3 straipsniai

pasiekiami

nepasiekiami

Pagal finansavimo įpareigojimus

Bendraautoriai

Rainer E. BurkardProfessor emer. of Mathematics, TU GrazPatvirtintas el. paštas opt.math.tu-graz.ac.at
Jiri SgallComputer Science Institute of Charles UniversityPatvirtintas el. paštas iuuk.mff.cuni.cz
Janos CsirikProfessor of Computer Science, University of SzegedPatvirtintas el. paštas inf.u-szeged.hu
Frits SpieksmaTU EindhovenPatvirtintas el. paštas tue.nl
Amos FiatProfessor of Computer Science, Tel Aviv UniversityPatvirtintas el. paštas tau.ac.il
Cor HurkensTU EindhovenPatvirtintas el. paštas tue.nl
Hajo BroersmaFaculty EEMCS, University of Twente, NLPatvirtintas el. paštas utwente.nl
Robert BredereckTU ClausthalPatvirtintas el. paštas tu-clausthal.de
Jiehua ChenTU ViennaPatvirtintas el. paštas tuwien.ac.at
Han HoogeveenUniversiteit UtrechtPatvirtintas el. paštas uu.nl
Bo Chen, Ph.D., D.Sc., FAcSSChair of Operational Research, Management Science & Analytics, University of WarwickPatvirtintas el. paštas warwick.ac.uk
Fedor V. FominProfessor of Computer Science, University of BergenPatvirtintas el. paštas uib.no
Leah EpsteinUniversity of HaifaPatvirtintas el. paštas math.haifa.ac.il
Hans KellererUniversity of GrazPatvirtintas el. paštas uni-graz.at
Gábor GalambosProfessor, University of SzegedPatvirtintas el. paštas jgypk.szte.hu
Kirk PruhsProfessor of Computer Science, University of PittsburghPatvirtintas el. paštas cs.pitt.edu
Ulrich PferschyUniversity of GrazPatvirtintas el. paštas uni-graz.at
Pierluigi CrescenziProfessor of Computer Science, GSSI, L'Aquila, ItalyPatvirtintas el. paštas gssi.it
Asaf LevinProfessor in Operations Research, The TechnionPatvirtintas el. paštas technion.ac.il
Jack van der VeenHoogleraar Supply Chain Management, NyenrodePatvirtintas el. paštas nyenrode.nl

Stebėti

Gerhard Woeginger

Professor of Computer Science, RWTH Aachen

Patvirtintas el. paštas cs.rwth-aachen.de

Theoretical Computer Science Discrete Mathematics Operations Research


Pavadinimas Rūšiuoti pagal šaltinius Rūšiuoti pagal metus Rūšiuoti pagal pavadinimą	Cituota Cituota	Metai
Online algorithms: The state of the art A Fiat, GJ Woeginger LNCS, Springer-Verlag 1442, 1998	2272*	1998
Exact algorithms for NP-hard problems: A survey GJ Woeginger Combinatorial optimization — Eureka, you shrink!, 185-207, 2003	1025	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	761*	2000
Computing and Software Science B Steffen, G Woeginger Springer Nature, LNCS 10000, 2019	684*	2019
A review of machine scheduling: Complexity, algorithms and approximability B Chen, CN Potts, GJ Woeginger Handbook of Combinatorial Optimization 3, 21-169, 1998	524*	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	282	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	276*	1998
Approximation schemes for scheduling on parallel machines N Alon, Y Azar, GJ Woeginger, T Yadid Journal of Scheduling 1 (1), 55-66, 1998	258	1998
A polynomial-time approximation scheme for maximizing the minimum machine completion time GJ Woeginger Operations Research Letters 20 (4), 149-154, 1997	248	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	242	2009
On-line packing and covering problems J Csirik, GJ Woeginger Online algorithms: the state of the art, 147-177, 2005	238	2005
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	225	2001
Almost tight bounds for ɛ-Nets J Komlós, J Pach, G Woeginger Discrete & Computational Geometry 7 (1), 163-173, 1992	198	1992
Polynomial time approximation algorithms for machine scheduling: Ten open problems P Schuurman, GJ Woeginger Journal of Scheduling 2 (5), 203-213, 1999	188	1999
An axiomatic characterization of the Hirsch-index GJ Woeginger Mathematical Social Sciences 56 (2), 224-232, 2008	186	2008
Proceedings of 43rd Workshop on Graph-Theoretic Concepts in Computer Science HL Bodlaender, GJ Woeginger Springer LNCS 10520, 2017	185*	2017
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	184	2004
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	181	1996
Getting the best response for your erg K Pruhs, P Uthaisombut, G Woeginger ACM Transactions on Algorithms (TALG) 4 (3), 1-17, 2008	179*	2008
There is no asymptotic PTAS for two-dimensional vector packing GJ Woeginger Information Processing Letters 64 (6), 293-297, 1997	174	1997

Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.

Straipsniai 1–20

Šaltinių per metus

Dubliuoti šaltiniai

Sujungti šaltiniai

Pridėti bendraautoriusBendraautoriai

Stebėti

Cituota

Bendraautoriai