Ekkehard Köhler - Concepedia

Author

Ekkehard Köhler

Brandenburg University of Technology Cottbus-Senftenberg

Also Known As

Brandstädt, Andreas 1949-, E. Kohler, Ekkehard A. Köhler, Ekkehard Köhler, K\"ohler, Ekkehard, Köhler, Ekkehard

Publications

1.4K

Citations

H-Index

Concepts

All Affiliations

Brandenburg University of Technology Cottbus-Senftenberg Technische Universität Berlin Kent State University University of Toronto Paderborn University

About

Ekkehard Köhler is an author at Brandenburg University of Technology Cottbus-Senftenberg specializing in engineering, combinatorial optimization, and discrete mathematics.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	11	13	545
2	Computer Science	8	8	352
3	Education	5	5	154
4	Business	4	4	121
5	Computer Engineering	4	4	196

Ekkehard Köhler

Publications

580

Citations

H-Index

Page 1

	Year	Citations
Optimal FPGA module placement with temporal precedence constraints Sándor P. Fekete, Ekkehard Köhler, J. Teich Design, Automation, and Test in Europe Mathematical ProgrammingEngineeringHardware AlgorithmComputer ArchitectureComputational Complexity	2001	96
The k-Splittable Flow Problem Georg Baier, Ekkehard Köhler, Martin Skutella Algorithmica Mathematical ProgrammingK-splittable Flow ProblemEngineeringCombinatorial ProblemAlgorithmic Efficiency	2005	95
Optimal FPGA module placement with temporal precedence constraints Sándor P. Fekete, Ekkehard Köhler, J. Teich Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 Mathematical ProgrammingEngineeringHardware AlgorithmComputer ArchitectureComputational Complexity	2002	66
Flows over Time with Load-Dependent Transit Times Ekkehard Köhler, Martin Skutella SIAM Journal on Optimization Mathematical ProgrammingTransport Network AnalysisEngineeringNetwork AnalysisFixed Time Horizon	2005	54
Length-bounded cuts and flows Georg Baier, Thomas Erlebach, Alexander Hall, ACM Transactions on Algorithms EngineeringGeometryLength-bounded CutsNetwork AnalysisEducation	2010	51
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs Feodor F. Dragan, Ekkehard Köhler Algorithmica Mathematical ProgrammingGeneralized Chordal GraphsGraph MinorEngineeringGraph Theory	2013	37
On the power of BFS to determine a graph's diameter Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler Networks EngineeringNetwork AnalysisEducationComputational ComplexityStructural Graph Theory	2003	37
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler SIAM Journal on Computing Mathematical ProgrammingDirected GraphNetwork ScienceGraph TheoryInduced Dominating Path	2000	27
On end-vertices of Lexicographic Breadth First Searches Derek G. Corneil, Ekkehard Köhler, Jean-Marc Lanlignel Discrete Applied Mathematics Graph TheoryInformation RetrievalStructural Graph TheoryKnowledge DiscoveryBusiness	2009	24
Traffic signal optimization using cyclically expanded networks Ekkehard Köhler, Martin Strehler Networks EngineeringNetwork PlanningTransportation Systems ModelingTraffic AssignmentNetwork Analysis	2015	24

Page 1