Karsten Weihe

From MaRDI portal
Person:820154

Available identifiers

zbMath Open weihe.karstenDBLPw/KarstenWeiheWikidataQ15430523 ScholiaQ15430523MaRDI QIDQ820154

List of research outcomes





PublicationDate of PublicationType
Improved approximations for minimum cardinality quadrangulations of finite element meshes2021-12-20Paper
Reconstructing the topology of a CAD model -- a discrete approach2021-12-20Paper
ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS2015-04-29Paper
https://portal.mardi4nfdi.de/entity/Q29346722014-12-18Paper
Local search starting from an LP solution2014-04-01Paper
Reliability and delay distributions of train connections2012-10-02Paper
Edge-disjoint routing in plane switch graphs in linear time2011-02-01Paper
On the cardinality of the Pareto set in bicriteria shortest path problems2010-03-23Paper
Workload Balancing in Multi-stage Production Processes2007-09-14Paper
Moving policies in cyclic assembly line scheduling2006-04-06Paper
Parameterized and Exact Computation2005-08-23Paper
Dijkstra's algorithm on-line2005-08-04Paper
QUADRANGULAR REFINEMENTS OF CONVEX POLYGONS WITH AN APPLICATION TO FINITE-ELEMENT MESHES2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q47855832003-01-05Paper
On the discrete core of quadrilateral mesh refinement2001-12-12Paper
Reconstructing the topology of a CAD model -- a discrete approach2000-12-05Paper
https://portal.mardi4nfdi.de/entity/Q49449912000-07-20Paper
A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works1999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42684381999-10-31Paper
Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time1998-08-04Paper
Mesh refinement via bidirected flows1998-02-17Paper
The Vertex-Disjoint Menger Problem in Planar Graphs1997-05-26Paper
Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time1997-04-27Paper
LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS1996-11-26Paper
https://portal.mardi4nfdi.de/entity/Q48860661996-10-21Paper
A linear-time algorithm for edge-disjoint paths in planar graphs1996-07-14Paper
https://portal.mardi4nfdi.de/entity/Q48407761996-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48603041996-01-15Paper
https://portal.mardi4nfdi.de/entity/Q31404101994-01-02Paper

Research outcomes over time

This page was built for person: Karsten Weihe