Ekkehard Köhler

Available identifiers

zbMath Open kohler.ekkehardWikidataQ102240144 ScholiaQ102240144MaRDI QIDQ264184

List of research outcomes

Publication	Date of Publication	Type
Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs	2023-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q5874479	2023-02-07	Paper
Edge elimination and weighted graph classes	2022-12-21	Paper
Recognizing graph search trees	2022-04-27	Paper
The Recognition Problem of Graph Search Trees	2021-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q5226833	2019-08-01	Paper
Eccentricity approximating trees	2017-10-17	Paper
Line-distortion, bandwidth and path-length of a graph	2017-04-12	Paper
Eccentricity Approximating Trees	2016-12-22	Paper
https://portal.mardi4nfdi.de/entity/Q2816022	2016-07-01	Paper
On the Power of Graph Searching for Cocomparability Graphs	2016-04-07	Paper
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs	2016-04-06	Paper
An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs	2014-11-19	Paper
Length-bounded cuts and flows	2014-09-09	Paper
Line-Distortion, Bandwidth and Path-Length of a Graph	2014-09-02	Paper
Linear Time LexDFS on Cocomparability Graphs.	2014-09-02	Paper
Collective additive tree spanners for circle graphs and polygonal graphs	2012-08-14	Paper
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs	2011-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q3574261	2010-07-09	Paper
On end-vertices of lexicographic breadth first searches	2010-05-05	Paper
Lower bounds for strictly fundamental cycle bases in grid graphs	2009-07-28	Paper
Traffic Networks and Flows over Time	2009-07-09	Paper
Length-Bounded Cuts and Flows	2009-03-12	Paper
Additive Spanners for Circle Graphs and Polygonal Graphs	2009-01-20	Paper
The Maximum Energy-Constrained Dynamic Flow Problem	2008-07-15	Paper
Benchmarks for Strictly Fundamental Cycle Bases	2008-01-02	Paper
Higher‐Dimensional Packing with Order Constraints	2007-11-16	Paper
Recognizing graphs without asteroidal triples	2007-04-26	Paper
Approximating earliest arrival flows with flow-dependent transit times	2007-02-19	Paper
Graph-Theoretic Concepts in Computer Science	2006-11-01	Paper
Linear Orderings of Subfamilies of AT‐Free Graphs	2006-06-01	Paper
The \(k\)-splittable flow problem	2006-03-21	Paper
Experimental and Efficient Algorithms	2005-11-30	Paper
https://portal.mardi4nfdi.de/entity/Q5706101	2005-11-04	Paper
Flows over Time with Load-Dependent Transit Times	2005-09-16	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q4828930	2004-11-29	Paper
https://portal.mardi4nfdi.de/entity/Q3044328	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4448763	2004-02-18	Paper
On the power of BFS to determine a graph's diameter	2004-02-03	Paper
Hereditary dominating pair graphs	2004-01-26	Paper
https://portal.mardi4nfdi.de/entity/Q4411349	2003-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4411394	2003-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4778564	2002-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q2766687	2002-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q2741346	2001-09-23	Paper
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs	2001-03-19	Paper
Connected domination and dominating clique in trapezoid graphs	2000-09-24	Paper
https://portal.mardi4nfdi.de/entity/Q4944993	2000-06-07	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Ekkehard Köhler