Karsten Weihe

Orcid: 0000-0003-3039-8454

Affiliations:
  • Darmstadt University of Technology, Germany


According to our database1, Karsten Weihe authored at least 58 papers between 1992 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Case Study on the Terms Novice Programmers Use to Describe Code Snippets in Java.
IEEE Trans. Educ., December, 2023

Choosing a Didactic Basis for an Instructional Video: What Are the Implications For Novice Programmers?
Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 1, 2023

2020
Efficient monitoring of public transport journeys.
Public Transp., 2020

2017
Arrive in Time by Train with High Probability.
Transp. Sci., 2017

Is Interaction More Important than Individual Performance?: A Study of Motifs in Wikia.
Proceedings of the 26th International Conference on World Wide Web Companion, 2017

Distributed Graph-based Topology Adaptation using Motif Signatures.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Improve Sentiment Analysis of Citations with Author Modelling.
Proceedings of the 7th Workshop on Computational Approaches to Subjectivity, 2016

Network Motifs May Improve Quality Assessment of Text Documents.
Proceedings of TextGraphs@NAACL-HLT 2016: the 10th Workshop on Graph-based Methods for Natural Language Processing, 2016

Evaluation study for clustering in wireless sensor networks.
Proceedings of the 10th International Symposium on Communication Systems, 2016

2015
Motifs in Networks.
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014
Knowledge Discovery in Scientific Literature.
Proceedings of the 12th Edition of the Konvens Conference, 2014

2012
Quantifying Semantics using Complex Network Analysis.
Proceedings of the COLING 2012, 2012

Reliability and Delay Distributions of Train Connections.
Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012

2010
Phase Synchronization in Railway Timetables
CoRR, 2010

2009
Local search starting from an LP solution: Fast and quite good.
ACM J. Exp. Algorithmics, 2009

2008
Weiterbildung an Universitäten: Gegenwartt und Zukunft.
Proceedings of the Lebenslanges Lernen in der Informatik: Workshop im Rahmen der GI-Jahrestagung INFORMATIK 2008 am 11. September 2008 in München, 2008

2007
Maximum <i>s-t</i>-flow with <i>k</i> crossings in <i>O</i>(<i>k</i><sup>3</sup><i>n</i> log <i>n</i>) time.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
Moving policies in cyclic assembly line scheduling.
Theor. Comput. Sci., 2006

On the cardinality of the Pareto set in bicriteria shortest path problems.
Ann. Oper. Res., 2006

Workload Balancing in Multi-stage Production Processes.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2005
Weak Symmetries in Problem Formulations.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Edge-disjoint routing in plane switch graphs in linear time.
J. ACM, 2004

2002
Getting Train Timetables into the Main Storage.
Proceedings of the Algorithmic Methods and Models for Optimization of Railways, 2002

2001
A software engineering perspective on algorithmics.
ACM Comput. Surv., 2001

Pareto Shortest Paths is Often Feasible in Practice.
Proceedings of the Algorithm Engineering, 2001

2000
Editorial: Discrete algorithm engineering.
Softw. Pract. Exp., 2000

Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.
ACM J. Exp. Algorithmics, 2000

On the Hardness of Recognizing Bundles in Time Table Graphs.
Int. J. Found. Comput. Sci., 2000

Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes.
Int. J. Comput. Geom. Appl., 2000

Reconstructing the Topology of a CAD Model - a Discrete Approach.
Algorithmica, 2000

On the Differences between "Practical" and "Applied".
Proceedings of the Algorithm Engineering, 2000

Recognizing Bundles in Time Table Graphs - A Structural Approach.
Proceedings of the Algorithm Engineering, 2000

1999
A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks.
Discret. Appl. Math., 1999

Edge-Disjoint Routing in Plane Switch Graphs in Linear Time.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Empirical Design of Geometric Algorithms.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Iterators Evaluate Table Queries (C++ Toolbox).
ACM SIGPLAN Notices, 1998

Laufzeitdynamische Evaluierung tabellarischer Daten.
Inform. Forsch. Entwickl., 1998

Why CAD Data Repair Requires Discrete Algorithmic Techniques.
Proceedings of the Algorithm Engineering, 2nd International Workshop, 1998

The STL Model in the Geometric Domain.
Proceedings of the Generic Programming, 1998

1997
The Vertex-Disjoint Menger Problem in Planar Graphs.
SIAM J. Comput., 1997

Maximum (s, t)-Flows in Planar Networks in O(|V|log|V|)-Time.
J. Comput. Syst. Sci., 1997

Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time.
J. Algorithms, 1997

Mesh refinement via bidirected flows: modeling, complexity, and computational results.
J. ACM, 1997

Multicommodity Flows in Even, Planar Networks.
Algorithmica, 1997

Efficient, Adaptable Implementations of Graph Algorithms.
Proceedings of the Workshop on Algorithm Engineering, 1997

Reuse of Algorithms: Still a Challenge to Object-Oriented Programming.
Proceedings of the 1997 ACM SIGPLAN Conference on Object-Oriented Programming Systems, 1997

Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes.
Proceedings of the Algorithms, 1997

Minimum Strictly Convex Quadrangulations of Convex Polygons.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
C++ im Nebenfachstudium: Konzepte und Erfahrungen.
Inform. Spektrum, 1996

Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs.
Int. J. Found. Comput. Sci., 1996

1995
Book reviews.
Math. Methods Oper. Res., 1995

A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs.
Comb., 1995

Using Network Flows for Surface Modeling.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

An Animated Library of Combinatorial VLSI-Routing Algorithms.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Wiring Knock-Knee Layouts: A Global Approach.
IEEE Trans. Computers, 1994

1993
Book reviews.
ZOR Methods Model. Oper. Res., 1993

Efficient algorithms for disjoint paths in planar graphs.
Proceedings of the Combinatorial Optimization, 1993

1992
Wiring Knock-Knee Layouts: A Global Appoach.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992


  Loading...