Klaus Jansen - Concepedia

Author

Klaus Jansen

Christian-Albrechts-Universität zu Kiel ORCID

Also Known As

Fischer, David, Garg, Naveen, Jansen, Klaus, K. Jansen, KLAUS JANSEN, Klaus Jansen, Robert Koch-Institut, Rolim, JosÃ©, Sinclair, Alistair, Trevisan, Luca

447

Publications

5.5K

Citations

H-Index

Concepts

All Affiliations

Christian-Albrechts-Universität zu Kiel Universität Trier Dalle Molle Institute for Artificial Intelligence Research Western University Max Planck Society

About

Klaus Jansen is an author at Christian-Albrechts-Universität zu Kiel specializing in combinatorial optimization, engineering, and computer science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	32	69	2.8K
2	Natural Sciences	10	10	554
3	Business	8	8	224
4	Education	2	2	249
5	Management	2	2	70

Klaus Jansen

Publications

3.3K

Citations

H-Index

Page 1

	Year	Citations
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs Thomas Erlebach, Klaus Jansen, Eike Seidel SIAM Journal on Computing Mathematical ProgrammingDisk GraphsEngineeringPlanar GraphConvex Hull	2005	173
Rankings of Graphs Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, SIAM Journal on Discrete Mathematics EngineeringEdge RankingNetwork AnalysisEducationComputational Complexity	1998	139
Polynomial-time approximation schemes for geometric graphs Thomas Erlebach, Klaus Jansen, Eike Seidel Symposium on Discrete Algorithms Disk GraphsEngineeringPlanar GraphConvex HullDisk Graph	2001	121
Generalized coloring for tree-like graphs Klaus Jansen, Petra Scheffler Discrete Applied Mathematics Mathematical ProgrammingEngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	1997	110
The complexity of path coloring and call scheduling Thomas Erlebach, Klaus Jansen Theoretical Computer Science EngineeringScheduling ProblemComputational ComplexityTime ComplexityParallel Programming	2001	103
An Approximation Scheme for Bin Packing with Conflicts Klaus Jansen Journal of Combinatorial Optimization	1999	99
Bin packing with fixed number of bins revisited Klaus Jansen, Stefan Kratsch, Dániel Marx, Journal of Computer and System Sciences Mathematical ProgrammingFixed NumberEngineeringCombinatory AnalysisCombinatorial Problem	2012	98
Scheduling with incompatible jobs Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger Discrete Applied Mathematics Mathematical ProgrammingJob SchedulerEngineeringScheduling ProblemIncompatible Jobs	1994	89
Approximation Algorithms for Time Constrained Scheduling Klaus Jansen, Sabine R. Öhring Information and Computation Mathematical ProgrammingEngineeringScheduling AnalysisScheduling ProblemScheduling (Production Processes)	1997	87
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables Klaus Jansen SIAM Journal on Discrete Mathematics Mathematical ProgrammingEngineeringComputer ArchitectureComputational ComplexityMilp Relaxation	2010	75

Page 1